./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:42:54,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:42:54,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:42:54,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:42:54,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:42:54,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:42:54,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:42:54,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:42:54,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:42:54,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:42:54,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:42:54,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:42:54,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:42:54,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:42:54,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:42:54,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:42:54,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:42:54,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:42:54,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:42:54,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:42:54,834 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:42:54,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:42:54,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:42:54,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:42:54,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:42:54,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:42:54,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:42:54,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:42:54,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:42:54,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:42:54,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:42:54,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:42:54,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:42:54,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:42:54,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:42:54,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:42:54,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:42:54,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:42:54,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:42:54,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:42:54,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:42:54,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:42:54,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:42:54,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:42:54,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:42:54,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:42:54,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:42:54,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:42:54,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:42:54,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:42:54,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:42:54,875 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:42:54,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:42:54,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:42:54,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:42:54,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:42:54,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:42:54,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:42:54,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:42:54,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:42:54,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:42:54,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:42:54,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:42:54,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:42:54,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:42:54,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:42:54,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:42:54,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:42:54,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:42:54,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:42:54,878 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:42:54,878 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:42:54,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:42:54,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2022-07-14 00:42:55,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:42:55,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:42:55,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:42:55,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:42:55,078 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:42:55,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-14 00:42:55,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fce96b2/e3141f8747c546899655af52feeeb6c1/FLAG0196a9ac7 [2022-07-14 00:42:55,622 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:42:55,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-14 00:42:55,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fce96b2/e3141f8747c546899655af52feeeb6c1/FLAG0196a9ac7 [2022-07-14 00:42:56,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fce96b2/e3141f8747c546899655af52feeeb6c1 [2022-07-14 00:42:56,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:42:56,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:42:56,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:42:56,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:42:56,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:42:56,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:56,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274254fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56, skipping insertion in model container [2022-07-14 00:42:56,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:56,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:42:56,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:42:56,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-14 00:42:56,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:42:56,805 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:42:56,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-14 00:42:56,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:42:56,964 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:42:56,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56 WrapperNode [2022-07-14 00:42:56,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:42:56,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:42:56,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:42:56,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:42:56,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,059 INFO L137 Inliner]: procedures = 117, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 863 [2022-07-14 00:42:57,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:42:57,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:42:57,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:42:57,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:42:57,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:42:57,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:42:57,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:42:57,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:42:57,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (1/1) ... [2022-07-14 00:42:57,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:42:57,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:42:57,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 00:42:57,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 00:42:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-14 00:42:57,215 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-14 00:42:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:42:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:42:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:42:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-14 00:42:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-14 00:42:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-14 00:42:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-14 00:42:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-14 00:42:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-14 00:42:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-14 00:42:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-14 00:42:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-14 00:42:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-14 00:42:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-14 00:42:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-14 00:42:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:42:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:42:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-14 00:42:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-14 00:42:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-14 00:42:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-14 00:42:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:42:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:42:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-14 00:42:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-14 00:42:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:42:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:42:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:42:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-14 00:42:57,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-14 00:42:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-14 00:42:57,219 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-14 00:42:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-14 00:42:57,219 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-14 00:42:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:42:57,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:42:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:42:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:42:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-14 00:42:57,220 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-14 00:42:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:42:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-14 00:42:57,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-14 00:42:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:42:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 00:42:57,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 00:42:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-14 00:42:57,221 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-14 00:42:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-14 00:42:57,221 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-14 00:42:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-14 00:42:57,222 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-14 00:42:57,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:42:57,222 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-14 00:42:57,223 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-14 00:42:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:42:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-14 00:42:57,224 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-14 00:42:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-14 00:42:57,224 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-14 00:42:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-14 00:42:57,224 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-14 00:42:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:42:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-14 00:42:57,224 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-14 00:42:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:42:57,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:42:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-14 00:42:57,225 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-14 00:42:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:42:57,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:42:57,475 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:42:57,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:42:57,699 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:42:58,147 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:42:58,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:42:58,159 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:42:58,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:42:58 BoogieIcfgContainer [2022-07-14 00:42:58,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:42:58,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:42:58,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:42:58,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:42:58,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:42:56" (1/3) ... [2022-07-14 00:42:58,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354a21a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:42:58, skipping insertion in model container [2022-07-14 00:42:58,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:42:56" (2/3) ... [2022-07-14 00:42:58,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354a21a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:42:58, skipping insertion in model container [2022-07-14 00:42:58,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:42:58" (3/3) ... [2022-07-14 00:42:58,171 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-14 00:42:58,181 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:42:58,181 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:42:58,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:42:58,236 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e038ac6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31693d78 [2022-07-14 00:42:58,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:42:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 288 states have (on average 1.375) internal successors, (396), 298 states have internal predecessors, (396), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2022-07-14 00:42:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 00:42:58,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:42:58,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:42:58,261 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:42:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:42:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 863061951, now seen corresponding path program 1 times [2022-07-14 00:42:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:42:58,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746990582] [2022-07-14 00:42:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:42:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:42:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:42:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:42:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 00:42:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:42:58,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746990582] [2022-07-14 00:42:58,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746990582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:42:58,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:42:58,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:42:58,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853144985] [2022-07-14 00:42:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:42:58,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:42:58,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:42:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:42:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:42:58,670 INFO L87 Difference]: Start difference. First operand has 399 states, 288 states have (on average 1.375) internal successors, (396), 298 states have internal predecessors, (396), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:42:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:42:59,126 INFO L93 Difference]: Finished difference Result 776 states and 1124 transitions. [2022-07-14 00:42:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:42:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-14 00:42:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:42:59,144 INFO L225 Difference]: With dead ends: 776 [2022-07-14 00:42:59,145 INFO L226 Difference]: Without dead ends: 367 [2022-07-14 00:42:59,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:42:59,157 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 544 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:42:59,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 742 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 00:42:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-14 00:42:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 277. [2022-07-14 00:42:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 206 states have internal predecessors, (263), 48 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-07-14 00:42:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 358 transitions. [2022-07-14 00:42:59,209 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 358 transitions. Word has length 39 [2022-07-14 00:42:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:42:59,210 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 358 transitions. [2022-07-14 00:42:59,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:42:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 358 transitions. [2022-07-14 00:42:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 00:42:59,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:42:59,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:42:59,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:42:59,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:42:59,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:42:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1622348299, now seen corresponding path program 1 times [2022-07-14 00:42:59,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:42:59,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852232844] [2022-07-14 00:42:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:42:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:42:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:42:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:42:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:42:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:42:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:42:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852232844] [2022-07-14 00:42:59,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852232844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:42:59,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:42:59,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:42:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132510340] [2022-07-14 00:42:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:42:59,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:42:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:42:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:42:59,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:42:59,323 INFO L87 Difference]: Start difference. First operand 277 states and 358 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:42:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:42:59,821 INFO L93 Difference]: Finished difference Result 796 states and 1053 transitions. [2022-07-14 00:42:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:42:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-14 00:42:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:42:59,827 INFO L225 Difference]: With dead ends: 796 [2022-07-14 00:42:59,827 INFO L226 Difference]: Without dead ends: 526 [2022-07-14 00:42:59,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:42:59,831 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 386 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:42:59,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 892 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:42:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-14 00:42:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 395. [2022-07-14 00:42:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 297 states have (on average 1.2861952861952861) internal successors, (382), 299 states have internal predecessors, (382), 65 states have call successors, (65), 33 states have call predecessors, (65), 32 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-14 00:42:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 511 transitions. [2022-07-14 00:42:59,856 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 511 transitions. Word has length 57 [2022-07-14 00:42:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:42:59,857 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 511 transitions. [2022-07-14 00:42:59,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:42:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 511 transitions. [2022-07-14 00:42:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 00:42:59,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:42:59,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:42:59,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:42:59,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:42:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:42:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1789312131, now seen corresponding path program 1 times [2022-07-14 00:42:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:42:59,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117851389] [2022-07-14 00:42:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:42:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:42:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:42:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:42:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:42:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:42:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:42:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117851389] [2022-07-14 00:42:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117851389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:42:59,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:42:59,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:42:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639218478] [2022-07-14 00:42:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:42:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:42:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:42:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:42:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:42:59,979 INFO L87 Difference]: Start difference. First operand 395 states and 511 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:00,505 INFO L93 Difference]: Finished difference Result 917 states and 1213 transitions. [2022-07-14 00:43:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:43:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-14 00:43:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:00,509 INFO L225 Difference]: With dead ends: 917 [2022-07-14 00:43:00,509 INFO L226 Difference]: Without dead ends: 539 [2022-07-14 00:43:00,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:43:00,511 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 524 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:00,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1111 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:43:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-07-14 00:43:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 405. [2022-07-14 00:43:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 305 states have (on average 1.2754098360655737) internal successors, (389), 307 states have internal predecessors, (389), 65 states have call successors, (65), 35 states have call predecessors, (65), 34 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-14 00:43:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 518 transitions. [2022-07-14 00:43:00,535 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 518 transitions. Word has length 58 [2022-07-14 00:43:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:00,536 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 518 transitions. [2022-07-14 00:43:00,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 518 transitions. [2022-07-14 00:43:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 00:43:00,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:00,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:00,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:43:00,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash 967197344, now seen corresponding path program 1 times [2022-07-14 00:43:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:00,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810524636] [2022-07-14 00:43:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:43:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 00:43:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:00,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:00,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:00,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810524636] [2022-07-14 00:43:00,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810524636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:00,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:00,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:43:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014548172] [2022-07-14 00:43:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:00,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:43:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:43:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:43:00,611 INFO L87 Difference]: Start difference. First operand 405 states and 518 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:01,064 INFO L93 Difference]: Finished difference Result 937 states and 1222 transitions. [2022-07-14 00:43:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:43:01,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2022-07-14 00:43:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:01,067 INFO L225 Difference]: With dead ends: 937 [2022-07-14 00:43:01,067 INFO L226 Difference]: Without dead ends: 549 [2022-07-14 00:43:01,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:43:01,069 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 659 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:01,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 981 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:43:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-07-14 00:43:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 415. [2022-07-14 00:43:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 313 states have (on average 1.2651757188498403) internal successors, (396), 315 states have internal predecessors, (396), 65 states have call successors, (65), 37 states have call predecessors, (65), 36 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-14 00:43:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 525 transitions. [2022-07-14 00:43:01,085 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 525 transitions. Word has length 56 [2022-07-14 00:43:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:01,085 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 525 transitions. [2022-07-14 00:43:01,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 525 transitions. [2022-07-14 00:43:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 00:43:01,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:01,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:01,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:43:01,087 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash 118188198, now seen corresponding path program 1 times [2022-07-14 00:43:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327690770] [2022-07-14 00:43:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:01,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:43:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:01,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:43:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:01,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:01,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327690770] [2022-07-14 00:43:01,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327690770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:01,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:01,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:43:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220428936] [2022-07-14 00:43:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:01,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:43:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:43:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:43:01,155 INFO L87 Difference]: Start difference. First operand 415 states and 525 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:01,931 INFO L93 Difference]: Finished difference Result 1487 states and 1927 transitions. [2022-07-14 00:43:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:43:01,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-07-14 00:43:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:01,936 INFO L225 Difference]: With dead ends: 1487 [2022-07-14 00:43:01,936 INFO L226 Difference]: Without dead ends: 1089 [2022-07-14 00:43:01,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:43:01,938 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 951 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:01,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1292 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 00:43:01,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-07-14 00:43:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 805. [2022-07-14 00:43:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 608 states have (on average 1.269736842105263) internal successors, (772), 617 states have internal predecessors, (772), 122 states have call successors, (122), 70 states have call predecessors, (122), 74 states have return successors, (138), 121 states have call predecessors, (138), 121 states have call successors, (138) [2022-07-14 00:43:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1032 transitions. [2022-07-14 00:43:01,967 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1032 transitions. Word has length 55 [2022-07-14 00:43:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:01,968 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1032 transitions. [2022-07-14 00:43:01,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1032 transitions. [2022-07-14 00:43:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 00:43:01,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:01,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:01,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:43:01,970 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -943497047, now seen corresponding path program 1 times [2022-07-14 00:43:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:01,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675042224] [2022-07-14 00:43:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:43:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:43:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:02,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675042224] [2022-07-14 00:43:02,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675042224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:02,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:02,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:43:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347229264] [2022-07-14 00:43:02,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:02,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:43:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:43:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:43:02,076 INFO L87 Difference]: Start difference. First operand 805 states and 1032 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:02,538 INFO L93 Difference]: Finished difference Result 1705 states and 2210 transitions. [2022-07-14 00:43:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:43:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2022-07-14 00:43:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:02,542 INFO L225 Difference]: With dead ends: 1705 [2022-07-14 00:43:02,542 INFO L226 Difference]: Without dead ends: 917 [2022-07-14 00:43:02,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:43:02,545 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 661 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:02,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 937 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:43:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-07-14 00:43:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 719. [2022-07-14 00:43:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 543 states have (on average 1.2615101289134438) internal successors, (685), 548 states have internal predecessors, (685), 106 states have call successors, (106), 65 states have call predecessors, (106), 69 states have return successors, (121), 107 states have call predecessors, (121), 105 states have call successors, (121) [2022-07-14 00:43:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 912 transitions. [2022-07-14 00:43:02,577 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 912 transitions. Word has length 57 [2022-07-14 00:43:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:02,577 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 912 transitions. [2022-07-14 00:43:02,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 00:43:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 912 transitions. [2022-07-14 00:43:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 00:43:02,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:02,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:43:02,579 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1665561776, now seen corresponding path program 1 times [2022-07-14 00:43:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:02,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635486097] [2022-07-14 00:43:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 00:43:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:43:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:43:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 00:43:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635486097] [2022-07-14 00:43:02,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635486097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099452994] [2022-07-14 00:43:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:02,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:02,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:02,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:02,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 00:43:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:02,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 00:43:02,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:02,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:02,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099452994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:02,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:43:02,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-07-14 00:43:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286262136] [2022-07-14 00:43:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:02,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:43:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:02,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:43:02,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:43:02,977 INFO L87 Difference]: Start difference. First operand 719 states and 912 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:03,126 INFO L93 Difference]: Finished difference Result 1747 states and 2216 transitions. [2022-07-14 00:43:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:43:03,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2022-07-14 00:43:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:03,130 INFO L225 Difference]: With dead ends: 1747 [2022-07-14 00:43:03,131 INFO L226 Difference]: Without dead ends: 1052 [2022-07-14 00:43:03,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-07-14 00:43:03,133 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 337 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:03,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2357 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-14 00:43:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2022-07-14 00:43:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 763 states have (on average 1.2699868938401049) internal successors, (969), 770 states have internal predecessors, (969), 146 states have call successors, (146), 89 states have call predecessors, (146), 95 states have return successors, (166), 147 states have call predecessors, (166), 145 states have call successors, (166) [2022-07-14 00:43:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1281 transitions. [2022-07-14 00:43:03,170 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1281 transitions. Word has length 67 [2022-07-14 00:43:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:03,170 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1281 transitions. [2022-07-14 00:43:03,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1281 transitions. [2022-07-14 00:43:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 00:43:03,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:03,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:03,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:03,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:03,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2022790021, now seen corresponding path program 1 times [2022-07-14 00:43:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:03,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425256036] [2022-07-14 00:43:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:43:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 00:43:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:43:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:03,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425256036] [2022-07-14 00:43:03,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425256036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790253665] [2022-07-14 00:43:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:03,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:03,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:03,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:43:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:03,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 00:43:03,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:03,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:03,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790253665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:03,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:43:03,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-14 00:43:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029528360] [2022-07-14 00:43:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:43:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:03,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:43:03,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:43:03,784 INFO L87 Difference]: Start difference. First operand 1005 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:03,940 INFO L93 Difference]: Finished difference Result 2325 states and 2960 transitions. [2022-07-14 00:43:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:43:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-07-14 00:43:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:03,947 INFO L225 Difference]: With dead ends: 2325 [2022-07-14 00:43:03,947 INFO L226 Difference]: Without dead ends: 1344 [2022-07-14 00:43:03,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:43:03,951 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 337 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:03,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2378 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-07-14 00:43:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1289. [2022-07-14 00:43:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 981 states have (on average 1.275229357798165) internal successors, (1251), 992 states have internal predecessors, (1251), 186 states have call successors, (186), 113 states have call predecessors, (186), 121 states have return successors, (211), 185 states have call predecessors, (211), 185 states have call successors, (211) [2022-07-14 00:43:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-14 00:43:03,993 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 68 [2022-07-14 00:43:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:03,993 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-14 00:43:03,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-14 00:43:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-14 00:43:03,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:03,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:04,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:04,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-14 00:43:04,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2110117865, now seen corresponding path program 1 times [2022-07-14 00:43:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:04,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498845947] [2022-07-14 00:43:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:43:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:43:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:43:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:04,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498845947] [2022-07-14 00:43:04,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498845947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:04,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345005201] [2022-07-14 00:43:04,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:04,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:04,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:04,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:04,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 00:43:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:04,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 00:43:04,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:04,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345005201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:04,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:43:04,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-14 00:43:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540516179] [2022-07-14 00:43:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:04,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:43:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:43:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:43:04,560 INFO L87 Difference]: Start difference. First operand 1289 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:04,723 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-14 00:43:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:43:04,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2022-07-14 00:43:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:04,729 INFO L225 Difference]: With dead ends: 2893 [2022-07-14 00:43:04,730 INFO L226 Difference]: Without dead ends: 1628 [2022-07-14 00:43:04,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:43:04,733 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 337 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:04,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2378 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-14 00:43:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-14 00:43:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 981 states have (on average 1.275229357798165) internal successors, (1251), 992 states have internal predecessors, (1251), 186 states have call successors, (186), 113 states have call predecessors, (186), 121 states have return successors, (211), 185 states have call predecessors, (211), 185 states have call successors, (211) [2022-07-14 00:43:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-14 00:43:04,775 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 69 [2022-07-14 00:43:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:04,776 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-14 00:43:04,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-14 00:43:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 00:43:04,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:04,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:04,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:04,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:04,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1874499426, now seen corresponding path program 1 times [2022-07-14 00:43:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:04,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827473553] [2022-07-14 00:43:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:43:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:43:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 00:43:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:05,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827473553] [2022-07-14 00:43:05,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827473553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:05,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494064890] [2022-07-14 00:43:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:05,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:05,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:05,118 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:05,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 00:43:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 00:43:05,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 00:43:05,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:05,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494064890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:05,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:43:05,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-14 00:43:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872539007] [2022-07-14 00:43:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:05,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:43:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:43:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:43:05,349 INFO L87 Difference]: Start difference. First operand 1289 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:05,499 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-14 00:43:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:43:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-07-14 00:43:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:05,506 INFO L225 Difference]: With dead ends: 2893 [2022-07-14 00:43:05,506 INFO L226 Difference]: Without dead ends: 1628 [2022-07-14 00:43:05,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:43:05,510 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 337 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:05,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2323 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-14 00:43:05,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-14 00:43:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 981 states have (on average 1.275229357798165) internal successors, (1251), 992 states have internal predecessors, (1251), 186 states have call successors, (186), 113 states have call predecessors, (186), 121 states have return successors, (211), 185 states have call predecessors, (211), 185 states have call successors, (211) [2022-07-14 00:43:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-14 00:43:05,569 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 70 [2022-07-14 00:43:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:05,570 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-14 00:43:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-14 00:43:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-14 00:43:05,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:05,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:05,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:05,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:05,790 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash -628405765, now seen corresponding path program 1 times [2022-07-14 00:43:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:05,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851336522] [2022-07-14 00:43:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:43:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:43:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:43:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-14 00:43:05,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:05,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851336522] [2022-07-14 00:43:05,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851336522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:05,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:05,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:43:05,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051188600] [2022-07-14 00:43:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:05,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:43:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:05,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:43:05,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:05,856 INFO L87 Difference]: Start difference. First operand 1289 states and 1648 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 00:43:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:06,256 INFO L93 Difference]: Finished difference Result 3232 states and 4215 transitions. [2022-07-14 00:43:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:43:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2022-07-14 00:43:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:06,264 INFO L225 Difference]: With dead ends: 3232 [2022-07-14 00:43:06,264 INFO L226 Difference]: Without dead ends: 1967 [2022-07-14 00:43:06,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:43:06,268 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 458 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:06,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1008 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 00:43:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-07-14 00:43:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1610. [2022-07-14 00:43:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1263 states have (on average 1.2866191607284243) internal successors, (1625), 1279 states have internal predecessors, (1625), 203 states have call successors, (203), 133 states have call predecessors, (203), 143 states have return successors, (230), 200 states have call predecessors, (230), 202 states have call successors, (230) [2022-07-14 00:43:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2058 transitions. [2022-07-14 00:43:06,341 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2058 transitions. Word has length 75 [2022-07-14 00:43:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:06,342 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2058 transitions. [2022-07-14 00:43:06,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 00:43:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2058 transitions. [2022-07-14 00:43:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 00:43:06,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:06,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:06,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 00:43:06,345 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1055310527, now seen corresponding path program 1 times [2022-07-14 00:43:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:06,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631098988] [2022-07-14 00:43:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:43:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 00:43:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 00:43:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:43:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 00:43:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:06,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631098988] [2022-07-14 00:43:06,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631098988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:06,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770597979] [2022-07-14 00:43:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:06,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:06,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:06,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 00:43:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:06,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 00:43:06,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 00:43:06,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 00:43:06,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770597979] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:06,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:43:06,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-14 00:43:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093267827] [2022-07-14 00:43:06,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:06,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 00:43:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:06,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 00:43:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-14 00:43:06,922 INFO L87 Difference]: Start difference. First operand 1610 states and 2058 transitions. Second operand has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 15 states have internal predecessors, (111), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 00:43:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:10,354 INFO L93 Difference]: Finished difference Result 4116 states and 5283 transitions. [2022-07-14 00:43:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-14 00:43:10,355 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 15 states have internal predecessors, (111), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 82 [2022-07-14 00:43:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:10,364 INFO L225 Difference]: With dead ends: 4116 [2022-07-14 00:43:10,364 INFO L226 Difference]: Without dead ends: 2509 [2022-07-14 00:43:10,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-07-14 00:43:10,368 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 2023 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 4783 mSolverCounterSat, 899 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 3361 SdHoareTripleChecker+Invalid, 5682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 899 IncrementalHoareTripleChecker+Valid, 4783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:10,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 3361 Invalid, 5682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [899 Valid, 4783 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-14 00:43:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-14 00:43:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1918. [2022-07-14 00:43:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1509 states have (on average 1.291583830351226) internal successors, (1949), 1525 states have internal predecessors, (1949), 241 states have call successors, (241), 157 states have call predecessors, (241), 167 states have return successors, (268), 238 states have call predecessors, (268), 240 states have call successors, (268) [2022-07-14 00:43:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-14 00:43:10,447 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 82 [2022-07-14 00:43:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:10,448 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-14 00:43:10,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 15 states have internal predecessors, (111), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 00:43:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-14 00:43:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 00:43:10,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:10,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:10,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:10,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-14 00:43:10,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1436141603, now seen corresponding path program 1 times [2022-07-14 00:43:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:10,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615381812] [2022-07-14 00:43:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:43:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:43:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 00:43:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 00:43:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 00:43:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615381812] [2022-07-14 00:43:10,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615381812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101381522] [2022-07-14 00:43:10,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:10,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:10,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:10,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 00:43:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 00:43:10,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 00:43:11,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 00:43:11,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101381522] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:11,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:43:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-14 00:43:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562283680] [2022-07-14 00:43:11,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:11,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 00:43:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:11,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 00:43:11,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-14 00:43:11,232 INFO L87 Difference]: Start difference. First operand 1918 states and 2458 transitions. Second operand has 22 states, 22 states have (on average 5.136363636363637) internal successors, (113), 15 states have internal predecessors, (113), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 00:43:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:14,625 INFO L93 Difference]: Finished difference Result 4819 states and 6199 transitions. [2022-07-14 00:43:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-14 00:43:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.136363636363637) internal successors, (113), 15 states have internal predecessors, (113), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 83 [2022-07-14 00:43:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:14,651 INFO L225 Difference]: With dead ends: 4819 [2022-07-14 00:43:14,652 INFO L226 Difference]: Without dead ends: 2904 [2022-07-14 00:43:14,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-07-14 00:43:14,656 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 2030 mSDsluCounter, 3300 mSDsCounter, 0 mSdLazyCounter, 5335 mSolverCounterSat, 883 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 6218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 883 IncrementalHoareTripleChecker+Valid, 5335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:14,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 3807 Invalid, 6218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [883 Valid, 5335 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-14 00:43:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2022-07-14 00:43:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1918. [2022-07-14 00:43:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1509 states have (on average 1.291583830351226) internal successors, (1949), 1525 states have internal predecessors, (1949), 241 states have call successors, (241), 157 states have call predecessors, (241), 167 states have return successors, (268), 238 states have call predecessors, (268), 240 states have call successors, (268) [2022-07-14 00:43:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-14 00:43:14,728 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 83 [2022-07-14 00:43:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:14,729 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-14 00:43:14,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.136363636363637) internal successors, (113), 15 states have internal predecessors, (113), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 00:43:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-14 00:43:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-14 00:43:14,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:14,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:14,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:14,950 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1849722856, now seen corresponding path program 1 times [2022-07-14 00:43:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123658472] [2022-07-14 00:43:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:43:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:43:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 00:43:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:43:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 00:43:15,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:15,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123658472] [2022-07-14 00:43:15,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123658472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:15,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294981149] [2022-07-14 00:43:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:15,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:15,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:15,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:15,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 00:43:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:15,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 00:43:15,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 00:43:15,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 00:43:15,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294981149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:15,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:43:15,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-14 00:43:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215066104] [2022-07-14 00:43:15,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:15,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 00:43:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:15,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 00:43:15,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-14 00:43:15,537 INFO L87 Difference]: Start difference. First operand 1918 states and 2458 transitions. Second operand has 22 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 15 states have internal predecessors, (115), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 00:43:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:18,549 INFO L93 Difference]: Finished difference Result 3746 states and 4789 transitions. [2022-07-14 00:43:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 00:43:18,550 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 15 states have internal predecessors, (115), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 84 [2022-07-14 00:43:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:18,555 INFO L225 Difference]: With dead ends: 3746 [2022-07-14 00:43:18,555 INFO L226 Difference]: Without dead ends: 1831 [2022-07-14 00:43:18,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=602, Invalid=2260, Unknown=0, NotChecked=0, Total=2862 [2022-07-14 00:43:18,559 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 1972 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 4893 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 3450 SdHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 4893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:18,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1997 Valid, 3450 Invalid, 5786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 4893 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 00:43:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-07-14 00:43:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1082. [2022-07-14 00:43:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 851 states have (on average 1.2867215041128084) internal successors, (1095), 855 states have internal predecessors, (1095), 135 states have call successors, (135), 91 states have call predecessors, (135), 95 states have return successors, (150), 135 states have call predecessors, (150), 134 states have call successors, (150) [2022-07-14 00:43:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1380 transitions. [2022-07-14 00:43:18,600 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1380 transitions. Word has length 84 [2022-07-14 00:43:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:18,601 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1380 transitions. [2022-07-14 00:43:18,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 15 states have internal predecessors, (115), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 00:43:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1380 transitions. [2022-07-14 00:43:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 00:43:18,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:18,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:18,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:18,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:18,813 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash -345111867, now seen corresponding path program 1 times [2022-07-14 00:43:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:18,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009077293] [2022-07-14 00:43:18,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:43:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 00:43:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 00:43:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 00:43:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:18,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009077293] [2022-07-14 00:43:18,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009077293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:18,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:18,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:43:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442460188] [2022-07-14 00:43:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:18,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:43:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:43:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:18,876 INFO L87 Difference]: Start difference. First operand 1082 states and 1380 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:19,376 INFO L93 Difference]: Finished difference Result 3120 states and 3980 transitions. [2022-07-14 00:43:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:43:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2022-07-14 00:43:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:19,383 INFO L225 Difference]: With dead ends: 3120 [2022-07-14 00:43:19,383 INFO L226 Difference]: Without dead ends: 2062 [2022-07-14 00:43:19,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:43:19,385 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 420 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:19,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1170 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:43:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-07-14 00:43:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1683. [2022-07-14 00:43:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1307 states have (on average 1.260902830910482) internal successors, (1648), 1313 states have internal predecessors, (1648), 207 states have call successors, (207), 159 states have call predecessors, (207), 168 states have return successors, (230), 210 states have call predecessors, (230), 206 states have call successors, (230) [2022-07-14 00:43:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2085 transitions. [2022-07-14 00:43:19,448 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2085 transitions. Word has length 88 [2022-07-14 00:43:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:19,448 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 2085 transitions. [2022-07-14 00:43:19,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2085 transitions. [2022-07-14 00:43:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-14 00:43:19,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:19,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 00:43:19,450 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1624461571, now seen corresponding path program 1 times [2022-07-14 00:43:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:19,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116726439] [2022-07-14 00:43:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:43:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:43:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 00:43:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 00:43:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:19,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116726439] [2022-07-14 00:43:19,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116726439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:19,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:19,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:43:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173960960] [2022-07-14 00:43:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:19,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:43:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:43:19,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:19,555 INFO L87 Difference]: Start difference. First operand 1683 states and 2085 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:19,858 INFO L93 Difference]: Finished difference Result 3720 states and 4659 transitions. [2022-07-14 00:43:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:43:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2022-07-14 00:43:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:19,865 INFO L225 Difference]: With dead ends: 3720 [2022-07-14 00:43:19,866 INFO L226 Difference]: Without dead ends: 2060 [2022-07-14 00:43:19,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:19,869 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 116 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:19,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 938 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:43:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-07-14 00:43:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1684. [2022-07-14 00:43:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1308 states have (on average 1.260703363914373) internal successors, (1649), 1314 states have internal predecessors, (1649), 207 states have call successors, (207), 159 states have call predecessors, (207), 168 states have return successors, (230), 210 states have call predecessors, (230), 206 states have call successors, (230) [2022-07-14 00:43:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2086 transitions. [2022-07-14 00:43:19,951 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2086 transitions. Word has length 89 [2022-07-14 00:43:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:19,951 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 2086 transitions. [2022-07-14 00:43:19,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2086 transitions. [2022-07-14 00:43:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-14 00:43:19,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:19,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 00:43:19,953 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1363223741, now seen corresponding path program 1 times [2022-07-14 00:43:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495415204] [2022-07-14 00:43:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:43:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:43:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 00:43:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 00:43:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495415204] [2022-07-14 00:43:20,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495415204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722102975] [2022-07-14 00:43:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:20,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:43:20,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 00:43:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:20,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 00:43:20,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-14 00:43:20,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 00:43:20,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722102975] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:20,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:43:20,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-14 00:43:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935544753] [2022-07-14 00:43:20,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:20,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:43:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:43:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:43:20,340 INFO L87 Difference]: Start difference. First operand 1684 states and 2086 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 00:43:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:20,975 INFO L93 Difference]: Finished difference Result 3723 states and 4664 transitions. [2022-07-14 00:43:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:43:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2022-07-14 00:43:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:20,982 INFO L225 Difference]: With dead ends: 3723 [2022-07-14 00:43:20,982 INFO L226 Difference]: Without dead ends: 2063 [2022-07-14 00:43:20,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:43:20,984 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 221 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:20,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1530 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:43:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-07-14 00:43:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1687. [2022-07-14 00:43:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1311 states have (on average 1.2601067887109076) internal successors, (1652), 1317 states have internal predecessors, (1652), 207 states have call successors, (207), 159 states have call predecessors, (207), 168 states have return successors, (230), 210 states have call predecessors, (230), 206 states have call successors, (230) [2022-07-14 00:43:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2089 transitions. [2022-07-14 00:43:21,069 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2089 transitions. Word has length 90 [2022-07-14 00:43:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:21,069 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2089 transitions. [2022-07-14 00:43:21,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 00:43:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2089 transitions. [2022-07-14 00:43:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-14 00:43:21,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:21,072 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:21,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:21,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 00:43:21,284 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -142119037, now seen corresponding path program 2 times [2022-07-14 00:43:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:21,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455652747] [2022-07-14 00:43:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:43:21,336 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 00:43:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:43:21,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 00:43:21,422 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 00:43:21,422 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-14 00:43:21,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 00:43:21,426 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:21,429 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 00:43:21,447 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,450 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,450 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,451 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,451 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,452 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,452 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,452 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,452 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,454 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,457 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,457 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,457 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,459 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,459 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,459 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,459 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,459 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,459 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,461 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,461 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,461 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,461 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,461 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,461 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,462 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,462 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,462 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,462 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,462 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,462 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,463 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,463 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,463 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,463 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,463 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,463 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,463 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,464 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,464 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,464 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,464 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,464 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,464 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,464 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,466 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,466 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,466 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,466 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,466 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,466 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,466 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,471 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,471 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,471 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,471 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,476 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,476 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,477 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,477 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,477 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,479 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,479 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,479 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,479 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,479 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,479 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,479 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,480 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,480 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:21,480 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:21,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:43:21 BoogieIcfgContainer [2022-07-14 00:43:21,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 00:43:21,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 00:43:21,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 00:43:21,567 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 00:43:21,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:42:58" (3/4) ... [2022-07-14 00:43:21,570 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 00:43:21,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 00:43:21,571 INFO L158 Benchmark]: Toolchain (without parser) took 25408.54ms. Allocated memory was 90.2MB in the beginning and 343.9MB in the end (delta: 253.8MB). Free memory was 46.9MB in the beginning and 145.9MB in the end (delta: -99.0MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2022-07-14 00:43:21,571 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 67.3MB in the beginning and 67.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:43:21,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.81ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 46.7MB in the beginning and 67.7MB in the end (delta: -21.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-14 00:43:21,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.92ms. Allocated memory is still 109.1MB. Free memory was 67.7MB in the beginning and 62.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 00:43:21,572 INFO L158 Benchmark]: Boogie Preprocessor took 97.56ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 55.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 00:43:21,572 INFO L158 Benchmark]: RCFGBuilder took 1002.73ms. Allocated memory is still 109.1MB. Free memory was 55.8MB in the beginning and 52.8MB in the end (delta: 3.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-07-14 00:43:21,572 INFO L158 Benchmark]: TraceAbstraction took 23403.68ms. Allocated memory was 109.1MB in the beginning and 343.9MB in the end (delta: 234.9MB). Free memory was 52.3MB in the beginning and 147.0MB in the end (delta: -94.7MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. [2022-07-14 00:43:21,573 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 343.9MB. Free memory was 147.0MB in the beginning and 145.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 00:43:21,576 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 67.3MB in the beginning and 67.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.81ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 46.7MB in the beginning and 67.7MB in the end (delta: -21.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.92ms. Allocated memory is still 109.1MB. Free memory was 67.7MB in the beginning and 62.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.56ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 55.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1002.73ms. Allocated memory is still 109.1MB. Free memory was 55.8MB in the beginning and 52.8MB in the end (delta: 3.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23403.68ms. Allocated memory was 109.1MB in the beginning and 343.9MB in the end (delta: 234.9MB). Free memory was 52.3MB in the beginning and 147.0MB in the end (delta: -94.7MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 343.9MB. Free memory was 147.0MB in the beginning and 145.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 1672]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 2227. Possible FailurePath: [L1695] int ldv_irq_1_2 = 0; [L1696] int LDV_IN_INTERRUPT = 1; [L1697] int ldv_irq_1_3 = 0; [L1698] struct platform_device *tegra_rtc_driver_group0 ; [L1699] void *ldv_irq_data_1_1 ; [L1700] int ldv_irq_1_1 = 0; [L1701] int ldv_irq_1_0 = 0; [L1702] int ldv_irq_line_1_3 ; [L1703] void *ldv_irq_data_1_0 ; [L1704] int ldv_state_variable_0 ; [L1705] struct device *tegra_rtc_ops_group1 ; [L1706] int ldv_state_variable_3 ; [L1707] int ldv_irq_line_1_0 ; [L1708] int ldv_state_variable_2 ; [L1709] void *ldv_irq_data_1_3 ; [L1710] int ref_cnt ; [L1711] int ldv_irq_line_1_1 ; [L1712] struct rtc_time *tegra_rtc_ops_group0 ; [L1713] void *ldv_irq_data_1_2 ; [L1714] int ldv_state_variable_1 ; [L1715] int ldv_irq_line_1_2 ; [L1716] struct rtc_wkalrm *tegra_rtc_ops_group2 ; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2243] int ldv_retval_2 ; [L2244] int ldv_retval_0 ; [L2246] int ldv_retval_1 ; [L2769] int ldv_init = 0; VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2398] struct seq_file *ldvarg1 ; [L2399] void *tmp ; [L2400] unsigned int ldvarg0 ; [L2401] unsigned int tmp___0 ; [L2402] pm_message_t ldvarg2 ; [L2403] int tmp___1 ; [L2404] int tmp___2 ; [L2405] int tmp___3 ; [L2406] int tmp___4 ; VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] CALL, EXPR ldv_zalloc(136U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=136, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, size=136, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=-2] [L2408] RET, EXPR ldv_zalloc(136U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(136U)={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] tmp = ldv_zalloc(136U) [L2409] ldvarg1 = (struct seq_file *)tmp [L2410] tmp___0 = __VERIFIER_nondet_uint() [L2411] ldvarg0 = tmp___0 [L2412] FCALL ldv_initialize() [L2413] FCALL memset((void *)(& ldvarg2), 0, 4U) [L2414] ldv_state_variable_1 = 1 [L2415] ref_cnt = 0 [L2416] ldv_state_variable_0 = 1 [L2417] ldv_state_variable_3 = 0 [L2418] ldv_state_variable_2 = 0 VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=1] [L2429] COND TRUE ldv_state_variable_0 != 0 [L2430] tmp___2 = __VERIFIER_nondet_int() [L2432] case 0: [L2440] case 1: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=1, tmp___2=1] [L2441] COND TRUE ldv_state_variable_0 == 1 [L2442] CALL, EXPR tegra_rtc_init() [L2230] int tmp ; [L2232] CALL, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2848] return __VERIFIER_nondet_int(); [L2232] RET, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2232] tmp = platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2233] return (tmp); VAL [\result=0, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp=0] [L2442] RET, EXPR tegra_rtc_init() [L2442] ldv_retval_0 = tegra_rtc_init() [L2443] COND TRUE ldv_retval_0 == 0 [L2444] ldv_state_variable_0 = 3 [L2445] ldv_state_variable_2 = 1 [L2446] CALL ldv_initialize_platform_driver_2() [L2363] void *tmp ; VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] CALL, EXPR ldv_zalloc(624U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=624, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, size=624, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=-3] [L2365] RET, EXPR ldv_zalloc(624U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_zalloc(624U)={0:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] tmp = ldv_zalloc(624U) [L2366] tegra_rtc_driver_group0 = (struct platform_device *)tmp VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L2446] RET ldv_initialize_platform_driver_2() [L2449] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=1, tmp___2=1] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: [L2574] case 1: [L2584] case 2: [L2604] case 3: [L2614] case 4: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=4] [L2615] COND TRUE ldv_state_variable_2 == 1 [L2616] CALL ldv_probe_2() [L2836] return __VERIFIER_nondet_int(); [L2616] RET ldv_probe_2() [L2617] ldv_state_variable_2 = 2 [L2618] ref_cnt = ref_cnt + 1 VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=4] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=4] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=0] [L2563] COND FALSE !(ldv_state_variable_2 == 4) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=0] [L2568] COND TRUE ldv_state_variable_2 == 2 VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=0] [L2569] CALL tegra_rtc_shutdown(tegra_rtc_driver_group0) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, pdev={0:0}, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2222] CALL tegra_rtc_alarm_irq_enable(& pdev->dev, 0U) VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1960] struct tegra_rtc_info *info ; [L1961] void *tmp ; [L1962] unsigned int status ; [L1963] unsigned long sl_irq_flags ; [L1964] u32 __v ; [L1965] u32 __v___0 ; VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=1] [L2807] RET, EXPR ldv_malloc(0UL) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1967] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] tmp = dev_get_drvdata((struct device const *)dev) [L1968] info = (struct tegra_rtc_info *)tmp VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1969] CALL tegra_rtc_wait_while_busy(dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1843] struct tegra_rtc_info *info ; [L1844] void *tmp ; [L1845] int retries ; [L1846] int tmp___0 ; [L1847] u32 tmp___1 ; VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=1] [L2807] RET, EXPR ldv_malloc(0UL) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1849] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] tmp = dev_get_drvdata((struct device const *)dev) [L1850] info = (struct tegra_rtc_info *)tmp [L1851] retries = 500 VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1862] CALL, EXPR tegra_rtc_check_busy(info) [L1833] u32 __v ; [L1834] u32 __v___0 ; [L1836] EXPR info->rtc_base [L1836] EXPR (unsigned int volatile *)info->rtc_base + 4U [L1836] __v___0 = *((unsigned int volatile *)info->rtc_base + 4U) [L1837] __v = __v___0 [L1838] return (__v & 1U); VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result=0, __this_module={627:630}, __v=0, __v___0=0, info={0:0}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1862] RET, EXPR tegra_rtc_check_busy(info) [L1862] tmp___1 = tegra_rtc_check_busy(info) [L1863] COND FALSE !(tmp___1 != 0U) [L1867] return (0); VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result=0, __this_module={627:630}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___1=0] [L1969] RET tegra_rtc_wait_while_busy(dev) VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tegra_rtc_wait_while_busy(dev)=0, tmp={0:0}] [L1970] CALL ldv_spin_lock_check() VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2783] COND FALSE !(ldv_init == 1) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2785] CALL ldv_error() VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1672] reach_error() VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 400 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12691 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12313 mSDsluCounter, 30655 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23538 mSDsCounter, 4235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20412 IncrementalHoareTripleChecker+Invalid, 24647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4235 mSolverCounterUnsat, 7117 mSDtfsCounter, 20412 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1441 GetRequests, 1120 SyntacticMatches, 4 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1918occurred in iteration=12, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 5565 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2110 ConstructedInterpolants, 0 QuantifiedInterpolants, 4248 SizeOfPredicates, 29 NumberOfNonLiveVariables, 5307 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 552/622 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 [2022-07-14 00:43:21,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:43:23,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:43:23,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:43:23,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:43:23,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:43:23,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:43:23,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:43:23,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:43:23,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:43:23,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:43:23,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:43:23,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:43:23,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:43:23,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:43:23,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:43:23,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:43:23,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:43:23,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:43:23,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:43:23,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:43:23,304 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:43:23,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:43:23,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:43:23,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:43:23,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:43:23,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:43:23,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:43:23,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:43:23,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:43:23,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:43:23,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:43:23,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:43:23,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:43:23,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:43:23,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:43:23,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:43:23,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:43:23,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:43:23,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:43:23,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:43:23,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:43:23,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:43:23,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-14 00:43:23,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:43:23,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:43:23,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:43:23,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:43:23,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:43:23,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:43:23,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:43:23,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:43:23,349 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:43:23,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:43:23,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:43:23,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:43:23,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:43:23,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:43:23,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 00:43:23,351 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 00:43:23,351 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 00:43:23,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:43:23,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:43:23,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:43:23,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:43:23,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:43:23,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:43:23,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:43:23,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:43:23,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:43:23,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:43:23,352 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 00:43:23,353 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 00:43:23,353 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:43:23,353 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:43:23,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:43:23,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 00:43:23,353 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2022-07-14 00:43:23,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:43:23,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:43:23,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:43:23,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:43:23,624 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:43:23,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-14 00:43:23,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f314923/2ce7aa6e7966481787f92f80c3f3de0b/FLAG97eda4e63 [2022-07-14 00:43:24,178 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:43:24,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-14 00:43:24,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f314923/2ce7aa6e7966481787f92f80c3f3de0b/FLAG97eda4e63 [2022-07-14 00:43:24,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f314923/2ce7aa6e7966481787f92f80c3f3de0b [2022-07-14 00:43:24,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:43:24,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:43:24,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:43:24,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:43:24,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:43:24,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:43:24" (1/1) ... [2022-07-14 00:43:24,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8c2125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:24, skipping insertion in model container [2022-07-14 00:43:24,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:43:24" (1/1) ... [2022-07-14 00:43:24,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:43:24,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:43:24,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-14 00:43:25,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:43:25,194 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 00:43:25,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:43:25,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-14 00:43:25,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:43:25,336 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:43:25,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-14 00:43:25,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:43:25,464 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:43:25,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25 WrapperNode [2022-07-14 00:43:25,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:43:25,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:43:25,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:43:25,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:43:25,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,534 INFO L137 Inliner]: procedures = 121, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 791 [2022-07-14 00:43:25,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:43:25,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:43:25,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:43:25,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:43:25,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:43:25,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:43:25,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:43:25,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:43:25,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (1/1) ... [2022-07-14 00:43:25,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:43:25,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:25,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 00:43:25,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 00:43:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-14 00:43:25,667 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-14 00:43:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 00:43:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-14 00:43:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 00:43:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:43:25,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:43:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-14 00:43:25,668 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-14 00:43:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-14 00:43:25,669 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-14 00:43:25,669 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-14 00:43:25,669 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-14 00:43:25,669 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-14 00:43:25,669 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-14 00:43:25,669 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-14 00:43:25,669 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-14 00:43:25,669 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-14 00:43:25,670 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-14 00:43:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:43:25,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:43:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-14 00:43:25,670 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-14 00:43:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-14 00:43:25,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-14 00:43:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:43:25,671 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:43:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-14 00:43:25,671 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-14 00:43:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:43:25,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:43:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-14 00:43:25,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-14 00:43:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-14 00:43:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-14 00:43:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:43:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-14 00:43:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-14 00:43:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-14 00:43:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 00:43:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-14 00:43:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-14 00:43:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-14 00:43:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-14 00:43:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-14 00:43:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-14 00:43:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-14 00:43:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-14 00:43:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-14 00:43:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:43:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-14 00:43:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-14 00:43:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:43:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:43:25,868 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:43:25,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:43:26,153 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:43:28,798 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:43:28,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:43:28,805 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:43:28,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:43:28 BoogieIcfgContainer [2022-07-14 00:43:28,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:43:28,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:43:28,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:43:28,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:43:28,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:43:24" (1/3) ... [2022-07-14 00:43:28,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cae922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:43:28, skipping insertion in model container [2022-07-14 00:43:28,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:43:25" (2/3) ... [2022-07-14 00:43:28,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cae922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:43:28, skipping insertion in model container [2022-07-14 00:43:28,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:43:28" (3/3) ... [2022-07-14 00:43:28,812 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-14 00:43:28,825 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:43:28,826 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:43:28,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:43:28,865 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48e8ee8f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f77f783 [2022-07-14 00:43:28,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:43:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 381 states, 270 states have (on average 1.3407407407407408) internal successors, (362), 280 states have internal predecessors, (362), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2022-07-14 00:43:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 00:43:28,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:28,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:28,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -422849068, now seen corresponding path program 1 times [2022-07-14 00:43:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:28,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789350081] [2022-07-14 00:43:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:28,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:28,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:28,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:28,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 00:43:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:29,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:43:29,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 00:43:29,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:29,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:29,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789350081] [2022-07-14 00:43:29,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789350081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:29,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:29,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:43:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662798544] [2022-07-14 00:43:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:29,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:43:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:43:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:29,219 INFO L87 Difference]: Start difference. First operand has 381 states, 270 states have (on average 1.3407407407407408) internal successors, (362), 280 states have internal predecessors, (362), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:43:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:29,320 INFO L93 Difference]: Finished difference Result 758 states and 1077 transitions. [2022-07-14 00:43:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:43:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-14 00:43:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:29,342 INFO L225 Difference]: With dead ends: 758 [2022-07-14 00:43:29,342 INFO L226 Difference]: Without dead ends: 366 [2022-07-14 00:43:29,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:29,354 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:29,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-14 00:43:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-07-14 00:43:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 263 states have (on average 1.311787072243346) internal successors, (345), 265 states have internal predecessors, (345), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-07-14 00:43:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 490 transitions. [2022-07-14 00:43:29,422 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 490 transitions. Word has length 39 [2022-07-14 00:43:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:29,423 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 490 transitions. [2022-07-14 00:43:29,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:43:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 490 transitions. [2022-07-14 00:43:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 00:43:29,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:29,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:29,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 00:43:29,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:29,644 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1341730321, now seen corresponding path program 1 times [2022-07-14 00:43:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:29,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728604732] [2022-07-14 00:43:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:29,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:29,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:29,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:29,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 00:43:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:29,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:43:29,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 00:43:29,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 00:43:29,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:29,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728604732] [2022-07-14 00:43:29,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728604732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:29,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:43:29,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-14 00:43:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935754668] [2022-07-14 00:43:29,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:29,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:43:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:29,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:43:29,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:43:29,960 INFO L87 Difference]: Start difference. First operand 366 states and 490 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:30,085 INFO L93 Difference]: Finished difference Result 728 states and 977 transitions. [2022-07-14 00:43:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:43:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-07-14 00:43:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:30,090 INFO L225 Difference]: With dead ends: 728 [2022-07-14 00:43:30,090 INFO L226 Difference]: Without dead ends: 369 [2022-07-14 00:43:30,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:43:30,098 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:30,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1460 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-14 00:43:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-07-14 00:43:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 266 states have (on average 1.3082706766917294) internal successors, (348), 268 states have internal predecessors, (348), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-07-14 00:43:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 493 transitions. [2022-07-14 00:43:30,124 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 493 transitions. Word has length 39 [2022-07-14 00:43:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:30,125 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 493 transitions. [2022-07-14 00:43:30,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 493 transitions. [2022-07-14 00:43:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 00:43:30,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:30,129 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:30,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-14 00:43:30,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:30,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash -376881154, now seen corresponding path program 2 times [2022-07-14 00:43:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:30,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710978434] [2022-07-14 00:43:30,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:43:30,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:30,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:30,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:30,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 00:43:30,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 00:43:30,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:43:30,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:43:30,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 00:43:30,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:30,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:30,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710978434] [2022-07-14 00:43:30,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710978434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:30,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:30,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:43:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3927512] [2022-07-14 00:43:30,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:30,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:43:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:43:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:30,547 INFO L87 Difference]: Start difference. First operand 369 states and 493 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:43:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:30,593 INFO L93 Difference]: Finished difference Result 621 states and 819 transitions. [2022-07-14 00:43:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:43:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-07-14 00:43:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:30,603 INFO L225 Difference]: With dead ends: 621 [2022-07-14 00:43:30,605 INFO L226 Difference]: Without dead ends: 263 [2022-07-14 00:43:30,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:30,608 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 327 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:30,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 333 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-14 00:43:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-14 00:43:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 191 states have (on average 1.2722513089005236) internal successors, (243), 192 states have internal predecessors, (243), 48 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-07-14 00:43:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2022-07-14 00:43:30,621 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 42 [2022-07-14 00:43:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:30,621 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2022-07-14 00:43:30,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:43:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2022-07-14 00:43:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 00:43:30,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:30,624 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:30,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:30,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:30,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:30,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2129106285, now seen corresponding path program 1 times [2022-07-14 00:43:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:30,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846098017] [2022-07-14 00:43:30,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:30,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:30,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:30,836 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:30,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 00:43:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:31,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:43:31,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:31,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:31,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:31,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846098017] [2022-07-14 00:43:31,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846098017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:31,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:31,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:43:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437954535] [2022-07-14 00:43:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:31,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:43:31,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:31,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:43:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:31,072 INFO L87 Difference]: Start difference. First operand 263 states and 338 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:31,169 INFO L93 Difference]: Finished difference Result 626 states and 807 transitions. [2022-07-14 00:43:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:43:31,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2022-07-14 00:43:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:31,172 INFO L225 Difference]: With dead ends: 626 [2022-07-14 00:43:31,172 INFO L226 Difference]: Without dead ends: 374 [2022-07-14 00:43:31,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:31,173 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 144 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:31,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 648 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:43:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-14 00:43:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2022-07-14 00:43:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 273 states have (on average 1.2820512820512822) internal successors, (350), 275 states have internal predecessors, (350), 65 states have call successors, (65), 33 states have call predecessors, (65), 32 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-14 00:43:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 479 transitions. [2022-07-14 00:43:31,188 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 479 transitions. Word has length 61 [2022-07-14 00:43:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:31,188 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 479 transitions. [2022-07-14 00:43:31,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 479 transitions. [2022-07-14 00:43:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 00:43:31,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:31,189 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:31,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-14 00:43:31,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:31,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 685608890, now seen corresponding path program 1 times [2022-07-14 00:43:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:31,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815692463] [2022-07-14 00:43:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:31,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:31,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:31,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 00:43:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:31,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:43:31,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:31,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:31,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:31,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815692463] [2022-07-14 00:43:31,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815692463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:31,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:31,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:43:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205808064] [2022-07-14 00:43:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:31,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:43:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:43:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:31,685 INFO L87 Difference]: Start difference. First operand 371 states and 479 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:31,805 INFO L93 Difference]: Finished difference Result 1095 states and 1427 transitions. [2022-07-14 00:43:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:43:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-07-14 00:43:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:31,810 INFO L225 Difference]: With dead ends: 1095 [2022-07-14 00:43:31,810 INFO L226 Difference]: Without dead ends: 744 [2022-07-14 00:43:31,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:43:31,811 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 332 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:31,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1484 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:43:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-14 00:43:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 721. [2022-07-14 00:43:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 530 states have (on average 1.2849056603773585) internal successors, (681), 542 states have internal predecessors, (681), 125 states have call successors, (125), 66 states have call predecessors, (125), 65 states have return successors, (127), 116 states have call predecessors, (127), 124 states have call successors, (127) [2022-07-14 00:43:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 933 transitions. [2022-07-14 00:43:31,845 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 933 transitions. Word has length 59 [2022-07-14 00:43:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:31,845 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 933 transitions. [2022-07-14 00:43:31,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 933 transitions. [2022-07-14 00:43:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-14 00:43:31,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:31,846 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:31,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:32,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:32,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2003167721, now seen corresponding path program 1 times [2022-07-14 00:43:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:32,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442526316] [2022-07-14 00:43:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:32,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:32,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:32,050 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:32,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 00:43:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:32,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:43:32,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:32,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:32,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:32,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442526316] [2022-07-14 00:43:32,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442526316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:32,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:32,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:43:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820057638] [2022-07-14 00:43:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:32,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:43:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:43:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:32,342 INFO L87 Difference]: Start difference. First operand 721 states and 933 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:32,451 INFO L93 Difference]: Finished difference Result 1454 states and 1889 transitions. [2022-07-14 00:43:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:43:32,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2022-07-14 00:43:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:32,467 INFO L225 Difference]: With dead ends: 1454 [2022-07-14 00:43:32,467 INFO L226 Difference]: Without dead ends: 753 [2022-07-14 00:43:32,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:43:32,469 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 323 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:32,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 980 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-07-14 00:43:32,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 729. [2022-07-14 00:43:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 538 states have (on average 1.2769516728624535) internal successors, (687), 548 states have internal predecessors, (687), 123 states have call successors, (123), 68 states have call predecessors, (123), 67 states have return successors, (125), 116 states have call predecessors, (125), 122 states have call successors, (125) [2022-07-14 00:43:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 935 transitions. [2022-07-14 00:43:32,491 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 935 transitions. Word has length 60 [2022-07-14 00:43:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:32,491 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 935 transitions. [2022-07-14 00:43:32,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 935 transitions. [2022-07-14 00:43:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 00:43:32,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:32,493 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:32,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:32,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:32,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash -524865236, now seen corresponding path program 1 times [2022-07-14 00:43:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:32,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299329726] [2022-07-14 00:43:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:32,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:32,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:32,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:32,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 00:43:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:32,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:43:32,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:32,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:32,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:32,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299329726] [2022-07-14 00:43:32,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299329726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:32,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:32,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:43:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56806362] [2022-07-14 00:43:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:32,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:43:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:43:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:32,994 INFO L87 Difference]: Start difference. First operand 729 states and 935 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:33,103 INFO L93 Difference]: Finished difference Result 1470 states and 1889 transitions. [2022-07-14 00:43:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:43:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2022-07-14 00:43:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:33,107 INFO L225 Difference]: With dead ends: 1470 [2022-07-14 00:43:33,107 INFO L226 Difference]: Without dead ends: 761 [2022-07-14 00:43:33,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:43:33,109 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 319 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:33,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 977 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-07-14 00:43:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 737. [2022-07-14 00:43:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 546 states have (on average 1.2692307692307692) internal successors, (693), 554 states have internal predecessors, (693), 121 states have call successors, (121), 70 states have call predecessors, (121), 69 states have return successors, (123), 116 states have call predecessors, (123), 120 states have call successors, (123) [2022-07-14 00:43:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 937 transitions. [2022-07-14 00:43:33,128 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 937 transitions. Word has length 62 [2022-07-14 00:43:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:33,128 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 937 transitions. [2022-07-14 00:43:33,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 937 transitions. [2022-07-14 00:43:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 00:43:33,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:33,129 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:33,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:33,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:33,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1732611677, now seen corresponding path program 1 times [2022-07-14 00:43:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:33,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901623623] [2022-07-14 00:43:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:33,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:33,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:33,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 00:43:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:33,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:43:33,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:33,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:33,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:33,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901623623] [2022-07-14 00:43:33,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901623623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:33,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:33,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:43:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460264744] [2022-07-14 00:43:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:33,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:43:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:33,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:43:33,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:43:33,628 INFO L87 Difference]: Start difference. First operand 737 states and 937 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:33,725 INFO L93 Difference]: Finished difference Result 1403 states and 1785 transitions. [2022-07-14 00:43:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:43:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2022-07-14 00:43:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:33,728 INFO L225 Difference]: With dead ends: 1403 [2022-07-14 00:43:33,728 INFO L226 Difference]: Without dead ends: 686 [2022-07-14 00:43:33,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:43:33,730 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:33,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 974 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:43:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-07-14 00:43:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 668. [2022-07-14 00:43:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 498 states have (on average 1.2590361445783131) internal successors, (627), 502 states have internal predecessors, (627), 105 states have call successors, (105), 65 states have call predecessors, (105), 64 states have return successors, (107), 102 states have call predecessors, (107), 104 states have call successors, (107) [2022-07-14 00:43:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 839 transitions. [2022-07-14 00:43:33,747 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 839 transitions. Word has length 61 [2022-07-14 00:43:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:33,747 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 839 transitions. [2022-07-14 00:43:33,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 00:43:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 839 transitions. [2022-07-14 00:43:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 00:43:33,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:33,748 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:33,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:33,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:33,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1941224850, now seen corresponding path program 1 times [2022-07-14 00:43:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:33,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331765457] [2022-07-14 00:43:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:33,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:33,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:33,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:33,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 00:43:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:34,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 00:43:34,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:43:34,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:43:34,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:34,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331765457] [2022-07-14 00:43:34,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331765457] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:34,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:43:34,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2022-07-14 00:43:34,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921632448] [2022-07-14 00:43:34,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:34,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:43:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:34,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:43:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:43:34,506 INFO L87 Difference]: Start difference. First operand 668 states and 839 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 00:43:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:35,444 INFO L93 Difference]: Finished difference Result 1622 states and 2039 transitions. [2022-07-14 00:43:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 00:43:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2022-07-14 00:43:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:35,449 INFO L225 Difference]: With dead ends: 1622 [2022-07-14 00:43:35,449 INFO L226 Difference]: Without dead ends: 981 [2022-07-14 00:43:35,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-14 00:43:35,451 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 341 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:35,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1996 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 00:43:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-14 00:43:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 918. [2022-07-14 00:43:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 688 states have (on average 1.2674418604651163) internal successors, (872), 690 states have internal predecessors, (872), 143 states have call successors, (143), 87 states have call predecessors, (143), 86 states have return successors, (145), 142 states have call predecessors, (145), 142 states have call successors, (145) [2022-07-14 00:43:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1160 transitions. [2022-07-14 00:43:35,494 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1160 transitions. Word has length 71 [2022-07-14 00:43:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:35,494 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1160 transitions. [2022-07-14 00:43:35,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 00:43:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1160 transitions. [2022-07-14 00:43:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-14 00:43:35,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:35,498 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:35,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:35,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:35,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash 644086264, now seen corresponding path program 1 times [2022-07-14 00:43:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:35,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064165693] [2022-07-14 00:43:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:35,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:35,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:35,713 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:35,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 00:43:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:35,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 00:43:35,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:36,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:36,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:36,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064165693] [2022-07-14 00:43:36,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064165693] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:36,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:43:36,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-14 00:43:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348968980] [2022-07-14 00:43:36,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:36,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 00:43:36,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 00:43:36,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:43:36,471 INFO L87 Difference]: Start difference. First operand 918 states and 1160 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-14 00:43:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:38,753 INFO L93 Difference]: Finished difference Result 2134 states and 2693 transitions. [2022-07-14 00:43:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 00:43:38,754 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2022-07-14 00:43:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:38,759 INFO L225 Difference]: With dead ends: 2134 [2022-07-14 00:43:38,759 INFO L226 Difference]: Without dead ends: 1243 [2022-07-14 00:43:38,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:43:38,761 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 722 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:38,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2738 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 00:43:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-07-14 00:43:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1178. [2022-07-14 00:43:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 884 states have (on average 1.2703619909502262) internal successors, (1123), 888 states have internal predecessors, (1123), 183 states have call successors, (183), 111 states have call predecessors, (183), 110 states have return successors, (185), 180 states have call predecessors, (185), 182 states have call successors, (185) [2022-07-14 00:43:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-14 00:43:38,789 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 72 [2022-07-14 00:43:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:38,789 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-14 00:43:38,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-14 00:43:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-14 00:43:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 00:43:38,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:38,792 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:38,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:39,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:39,003 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:39,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1082506311, now seen corresponding path program 1 times [2022-07-14 00:43:39,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:39,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634913047] [2022-07-14 00:43:39,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:39,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:39,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:39,005 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:39,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 00:43:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:39,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 00:43:39,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:39,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:39,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:39,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634913047] [2022-07-14 00:43:39,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634913047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:39,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:43:39,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-14 00:43:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478842377] [2022-07-14 00:43:39,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:39,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 00:43:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 00:43:39,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:43:39,642 INFO L87 Difference]: Start difference. First operand 1178 states and 1491 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-14 00:43:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:41,210 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-14 00:43:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 00:43:41,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 73 [2022-07-14 00:43:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:41,216 INFO L225 Difference]: With dead ends: 2654 [2022-07-14 00:43:41,218 INFO L226 Difference]: Without dead ends: 1503 [2022-07-14 00:43:41,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:43:41,221 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 764 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:41,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 2510 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 00:43:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-14 00:43:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-14 00:43:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 884 states have (on average 1.2703619909502262) internal successors, (1123), 888 states have internal predecessors, (1123), 183 states have call successors, (183), 111 states have call predecessors, (183), 110 states have return successors, (185), 180 states have call predecessors, (185), 182 states have call successors, (185) [2022-07-14 00:43:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-14 00:43:41,257 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 73 [2022-07-14 00:43:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:41,257 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-14 00:43:41,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-14 00:43:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-14 00:43:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 00:43:41,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:41,260 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:41,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:41,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:41,467 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash -608187279, now seen corresponding path program 1 times [2022-07-14 00:43:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:41,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118170304] [2022-07-14 00:43:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:41,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:41,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:41,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 00:43:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:41,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 00:43:41,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:41,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:42,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118170304] [2022-07-14 00:43:42,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118170304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:42,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:43:42,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-14 00:43:42,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568895149] [2022-07-14 00:43:42,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:42,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 00:43:42,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:42,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 00:43:42,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:43:42,153 INFO L87 Difference]: Start difference. First operand 1178 states and 1491 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-14 00:43:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:43,372 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-14 00:43:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 00:43:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-07-14 00:43:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:43,379 INFO L225 Difference]: With dead ends: 2654 [2022-07-14 00:43:43,379 INFO L226 Difference]: Without dead ends: 1503 [2022-07-14 00:43:43,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:43:43,382 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 774 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:43,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1869 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 00:43:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-14 00:43:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-14 00:43:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 884 states have (on average 1.2703619909502262) internal successors, (1123), 888 states have internal predecessors, (1123), 183 states have call successors, (183), 111 states have call predecessors, (183), 110 states have return successors, (185), 180 states have call predecessors, (185), 182 states have call successors, (185) [2022-07-14 00:43:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-14 00:43:43,425 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 74 [2022-07-14 00:43:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:43,426 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-14 00:43:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-14 00:43:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-14 00:43:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 00:43:43,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:43,429 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:43,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:43,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:43,640 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2022215437, now seen corresponding path program 1 times [2022-07-14 00:43:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:43,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718896111] [2022-07-14 00:43:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:43,642 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:43,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 00:43:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:43,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:43:43,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 00:43:43,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:43,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:43,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718896111] [2022-07-14 00:43:43,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718896111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:43,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:43,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:43:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383247609] [2022-07-14 00:43:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:43,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:43:43,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:43,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:43:43,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:43,901 INFO L87 Difference]: Start difference. First operand 1178 states and 1491 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 00:43:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:44,052 INFO L93 Difference]: Finished difference Result 2624 states and 3365 transitions. [2022-07-14 00:43:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:43:44,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 79 [2022-07-14 00:43:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:44,058 INFO L225 Difference]: With dead ends: 2624 [2022-07-14 00:43:44,058 INFO L226 Difference]: Without dead ends: 1473 [2022-07-14 00:43:44,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:44,062 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 151 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:44,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 762 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:43:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-07-14 00:43:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1470. [2022-07-14 00:43:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1141 states have (on average 1.284837861524978) internal successors, (1466), 1147 states have internal predecessors, (1466), 199 states have call successors, (199), 130 states have call predecessors, (199), 129 states have return successors, (201), 195 states have call predecessors, (201), 198 states have call successors, (201) [2022-07-14 00:43:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1866 transitions. [2022-07-14 00:43:44,096 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1866 transitions. Word has length 79 [2022-07-14 00:43:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:44,097 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 1866 transitions. [2022-07-14 00:43:44,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 00:43:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1866 transitions. [2022-07-14 00:43:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-14 00:43:44,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:44,099 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:44,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:44,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:44,310 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1967013804, now seen corresponding path program 1 times [2022-07-14 00:43:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:44,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809920806] [2022-07-14 00:43:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:44,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:44,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:44,312 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:44,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 00:43:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:44,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 00:43:44,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 00:43:44,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 00:43:45,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:45,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809920806] [2022-07-14 00:43:45,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809920806] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:43:45,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:43:45,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-07-14 00:43:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892891217] [2022-07-14 00:43:45,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:45,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 00:43:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 00:43:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:43:45,247 INFO L87 Difference]: Start difference. First operand 1470 states and 1866 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-14 00:43:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:46,798 INFO L93 Difference]: Finished difference Result 3170 states and 4014 transitions. [2022-07-14 00:43:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 00:43:46,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 84 [2022-07-14 00:43:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:46,804 INFO L225 Difference]: With dead ends: 3170 [2022-07-14 00:43:46,804 INFO L226 Difference]: Without dead ends: 1727 [2022-07-14 00:43:46,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-07-14 00:43:46,807 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 709 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:46,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2749 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 00:43:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-07-14 00:43:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 412. [2022-07-14 00:43:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.2397476340694007) internal successors, (393), 317 states have internal predecessors, (393), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-14 00:43:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 502 transitions. [2022-07-14 00:43:46,825 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 502 transitions. Word has length 84 [2022-07-14 00:43:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:46,825 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 502 transitions. [2022-07-14 00:43:46,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-14 00:43:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 502 transitions. [2022-07-14 00:43:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-14 00:43:46,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:46,827 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:46,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:47,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:47,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash -446383630, now seen corresponding path program 1 times [2022-07-14 00:43:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580142547] [2022-07-14 00:43:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:47,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:47,047 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:47,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 00:43:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:47,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:43:47,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 00:43:47,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:43:47,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:43:47,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580142547] [2022-07-14 00:43:47,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580142547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:43:47,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:43:47,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:43:47,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783116203] [2022-07-14 00:43:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:43:47,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:43:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:43:47,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:43:47,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:47,280 INFO L87 Difference]: Start difference. First operand 412 states and 502 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:47,383 INFO L93 Difference]: Finished difference Result 1001 states and 1214 transitions. [2022-07-14 00:43:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:43:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2022-07-14 00:43:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:47,385 INFO L225 Difference]: With dead ends: 1001 [2022-07-14 00:43:47,386 INFO L226 Difference]: Without dead ends: 616 [2022-07-14 00:43:47,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:43:47,387 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 233 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:47,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 677 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:43:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-07-14 00:43:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2022-07-14 00:43:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 467 states have (on average 1.220556745182013) internal successors, (570), 467 states have internal predecessors, (570), 81 states have call successors, (81), 65 states have call predecessors, (81), 64 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-07-14 00:43:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 731 transitions. [2022-07-14 00:43:47,404 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 731 transitions. Word has length 92 [2022-07-14 00:43:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:47,405 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 731 transitions. [2022-07-14 00:43:47,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 00:43:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 731 transitions. [2022-07-14 00:43:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-14 00:43:47,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:47,406 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:47,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 00:43:47,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:47,618 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1210197595, now seen corresponding path program 1 times [2022-07-14 00:43:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:43:47,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717203977] [2022-07-14 00:43:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:43:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:43:47,620 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:43:47,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 00:43:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:43:47,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 00:43:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:43:48,369 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 00:43:48,369 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 00:43:48,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-14 00:43:48,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-14 00:43:48,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:43:48,582 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:43:48,584 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 00:43:48,615 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,618 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,619 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,619 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,619 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,619 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,620 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,620 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,623 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,625 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,625 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,625 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,627 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,628 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,630 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,631 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,631 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,631 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,631 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,631 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,631 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:43:48,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:43:48,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:43:48 BoogieIcfgContainer [2022-07-14 00:43:48,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 00:43:48,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 00:43:48,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 00:43:48,753 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 00:43:48,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:43:28" (3/4) ... [2022-07-14 00:43:48,756 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 00:43:48,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 00:43:48,756 INFO L158 Benchmark]: Toolchain (without parser) took 24062.10ms. Allocated memory was 58.7MB in the beginning and 146.8MB in the end (delta: 88.1MB). Free memory was 35.4MB in the beginning and 72.2MB in the end (delta: -36.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-07-14 00:43:48,756 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:43:48,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.15ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 37.8MB in the end (delta: -2.5MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2022-07-14 00:43:48,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.19ms. Allocated memory is still 73.4MB. Free memory was 37.8MB in the beginning and 32.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 00:43:48,757 INFO L158 Benchmark]: Boogie Preprocessor took 77.44ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 32.2MB in the beginning and 66.2MB in the end (delta: -34.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-07-14 00:43:48,757 INFO L158 Benchmark]: RCFGBuilder took 3193.85ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 41.7MB in the end (delta: 24.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-07-14 00:43:48,757 INFO L158 Benchmark]: TraceAbstraction took 19944.31ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 41.3MB in the beginning and 73.3MB in the end (delta: -32.0MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2022-07-14 00:43:48,758 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 146.8MB. Free memory was 73.3MB in the beginning and 72.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:43:48,759 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.15ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 37.8MB in the end (delta: -2.5MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.19ms. Allocated memory is still 73.4MB. Free memory was 37.8MB in the beginning and 32.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.44ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 32.2MB in the beginning and 66.2MB in the end (delta: -34.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * RCFGBuilder took 3193.85ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 41.7MB in the end (delta: 24.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19944.31ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 41.3MB in the beginning and 73.3MB in the end (delta: -32.0MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 146.8MB. Free memory was 73.3MB in the beginning and 72.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 1672]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 2227. Possible FailurePath: [L1695] int ldv_irq_1_2 = 0; [L1696] int LDV_IN_INTERRUPT = 1; [L1697] int ldv_irq_1_3 = 0; [L1698] struct platform_device *tegra_rtc_driver_group0 ; [L1699] void *ldv_irq_data_1_1 ; [L1700] int ldv_irq_1_1 = 0; [L1701] int ldv_irq_1_0 = 0; [L1702] int ldv_irq_line_1_3 ; [L1703] void *ldv_irq_data_1_0 ; [L1704] int ldv_state_variable_0 ; [L1705] struct device *tegra_rtc_ops_group1 ; [L1706] int ldv_state_variable_3 ; [L1707] int ldv_irq_line_1_0 ; [L1708] int ldv_state_variable_2 ; [L1709] void *ldv_irq_data_1_3 ; [L1710] int ref_cnt ; [L1711] int ldv_irq_line_1_1 ; [L1712] struct rtc_time *tegra_rtc_ops_group0 ; [L1713] void *ldv_irq_data_1_2 ; [L1714] int ldv_state_variable_1 ; [L1715] int ldv_irq_line_1_2 ; [L1716] struct rtc_wkalrm *tegra_rtc_ops_group2 ; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2243] int ldv_retval_2 ; [L2244] int ldv_retval_0 ; [L2246] int ldv_retval_1 ; [L2769] int ldv_init = 0; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2398] struct seq_file *ldvarg1 ; [L2399] void *tmp ; [L2400] unsigned int ldvarg0 ; [L2401] unsigned int tmp___0 ; [L2402] pm_message_t ldvarg2 ; [L2403] int tmp___1 ; [L2404] int tmp___2 ; [L2405] int tmp___3 ; [L2406] int tmp___4 ; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] CALL, EXPR ldv_zalloc(136U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=136, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, size=136, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2408] RET, EXPR ldv_zalloc(136U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(136U)={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] tmp = ldv_zalloc(136U) [L2409] ldvarg1 = (struct seq_file *)tmp [L2410] tmp___0 = __VERIFIER_nondet_uint() [L2411] ldvarg0 = tmp___0 [L2412] FCALL ldv_initialize() [L2413] FCALL memset((void *)(& ldvarg2), 0, 4U) [L2414] ldv_state_variable_1 = 1 [L2415] ref_cnt = 0 [L2416] ldv_state_variable_0 = 1 [L2417] ldv_state_variable_3 = 0 [L2418] ldv_state_variable_2 = 0 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=1] [L2429] COND TRUE ldv_state_variable_0 != 0 [L2430] tmp___2 = __VERIFIER_nondet_int() [L2432] case 0: [L2440] case 1: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=1, tmp___2=1] [L2441] COND TRUE ldv_state_variable_0 == 1 [L2442] CALL, EXPR tegra_rtc_init() [L2230] int tmp ; [L2232] CALL, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2848] return __VERIFIER_nondet_int(); [L2232] RET, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2232] tmp = platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2233] return (tmp); VAL [\result=0, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp=0] [L2442] RET, EXPR tegra_rtc_init() [L2442] ldv_retval_0 = tegra_rtc_init() [L2443] COND TRUE ldv_retval_0 == 0 [L2444] ldv_state_variable_0 = 3 [L2445] ldv_state_variable_2 = 1 [L2446] CALL ldv_initialize_platform_driver_2() [L2363] void *tmp ; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] CALL, EXPR ldv_zalloc(624U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=624, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, size=624, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2365] RET, EXPR ldv_zalloc(624U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_zalloc(624U)={0:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] tmp = ldv_zalloc(624U) [L2366] tegra_rtc_driver_group0 = (struct platform_device *)tmp VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L2446] RET ldv_initialize_platform_driver_2() [L2449] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=1, tmp___2=1] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: [L2574] case 1: [L2584] case 2: [L2604] case 3: [L2614] case 4: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=4] [L2615] COND TRUE ldv_state_variable_2 == 1 [L2616] CALL ldv_probe_2() [L2836] return __VERIFIER_nondet_int(); [L2616] RET ldv_probe_2() [L2617] ldv_state_variable_2 = 2 [L2618] ref_cnt = ref_cnt + 1 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=4] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=4] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=0] [L2563] COND FALSE !(ldv_state_variable_2 == 4) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=0] [L2568] COND TRUE ldv_state_variable_2 == 2 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=0] [L2569] CALL tegra_rtc_shutdown(tegra_rtc_driver_group0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, pdev={0:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2222] CALL tegra_rtc_alarm_irq_enable(& pdev->dev, 0U) VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1960] struct tegra_rtc_info *info ; [L1961] void *tmp ; [L1962] unsigned int status ; [L1963] unsigned long sl_irq_flags ; [L1964] u32 __v ; [L1965] u32 __v___0 ; VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [__this_module={0:0}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2807] RET, EXPR ldv_malloc(0UL) VAL [__this_module={0:0}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1967] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] tmp = dev_get_drvdata((struct device const *)dev) [L1968] info = (struct tegra_rtc_info *)tmp VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1969] CALL tegra_rtc_wait_while_busy(dev) VAL [__this_module={0:0}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1843] struct tegra_rtc_info *info ; [L1844] void *tmp ; [L1845] int retries ; [L1846] int tmp___0 ; [L1847] u32 tmp___1 ; VAL [__this_module={0:0}, dev={0:12}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [__this_module={0:0}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2807] RET, EXPR ldv_malloc(0UL) VAL [__this_module={0:0}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1849] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [__this_module={0:0}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] tmp = dev_get_drvdata((struct device const *)dev) [L1850] info = (struct tegra_rtc_info *)tmp [L1851] retries = 500 VAL [__this_module={0:0}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1862] CALL, EXPR tegra_rtc_check_busy(info) [L1833] u32 __v ; [L1834] u32 __v___0 ; [L1836] EXPR info->rtc_base [L1836] EXPR (unsigned int volatile *)info->rtc_base + 4U [L1836] __v___0 = *((unsigned int volatile *)info->rtc_base + 4U) [L1837] __v = __v___0 [L1838] return (__v & 1U); VAL [\result=0, __this_module={0:0}, __v=0, __v___0=0, info={0:0}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1862] RET, EXPR tegra_rtc_check_busy(info) [L1862] tmp___1 = tegra_rtc_check_busy(info) [L1863] COND FALSE !(tmp___1 != 0U) [L1867] return (0); VAL [\result=0, __this_module={0:0}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___1=0] [L1969] RET tegra_rtc_wait_while_busy(dev) VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tegra_rtc_wait_while_busy(dev)=0, tmp={0:0}] [L1970] CALL ldv_spin_lock_check() VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2783] COND FALSE !(ldv_init == 1) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2785] CALL ldv_error() VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1672] reach_error() VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 382 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5496 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5457 mSDsluCounter, 21173 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15383 mSDsCounter, 845 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2819 IncrementalHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 845 mSolverCounterUnsat, 5790 mSDtfsCounter, 2819 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1436 GetRequests, 1297 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1470occurred in iteration=13, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2191 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1360 ConstructedInterpolants, 0 QuantifiedInterpolants, 2630 SizeOfPredicates, 34 NumberOfNonLiveVariables, 5292 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 392/455 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 [2022-07-14 00:43:48,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample