./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 eb692b52 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-?-eb692b5 [2022-07-20 00:04:28,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:04:28,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:04:28,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:04:28,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:04:28,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:04:28,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:04:28,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:04:28,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:04:28,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:04:28,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:04:28,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:04:28,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:04:28,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:04:28,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:04:28,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:04:28,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:04:28,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:04:28,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:04:28,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:04:28,834 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:04:28,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:04:28,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:04:28,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:04:28,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:04:28,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:04:28,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:04:28,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:04:28,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:04:28,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:04:28,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:04:28,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:04:28,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:04:28,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:04:28,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:04:28,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:04:28,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:04:28,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:04:28,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:04:28,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:04:28,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:04:28,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:04:28,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 00:04:28,880 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:04:28,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:04:28,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:04:28,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:04:28,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:04:28,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:04:28,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:04:28,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:04:28,883 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:04:28,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:04:28,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:04:28,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:04:28,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:04:28,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:04:28,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:04:28,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:04:28,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:04:28,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:04:28,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 00:04:28,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 00:04:28,887 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:04:28,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:04:28,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:04:28,887 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-20 00:04:29,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:04:29,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:04:29,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:04:29,194 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:04:29,194 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:04:29,199 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-20 00:04:29,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2fae0bf/f30d4f9503a44f3f8d538234e36ff2a9/FLAG33093b038 [2022-07-20 00:04:29,739 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:04:29,740 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-20 00:04:29,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2fae0bf/f30d4f9503a44f3f8d538234e36ff2a9/FLAG33093b038 [2022-07-20 00:04:30,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2fae0bf/f30d4f9503a44f3f8d538234e36ff2a9 [2022-07-20 00:04:30,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:04:30,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:04:30,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:04:30,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:04:30,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:04:30,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4231ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30, skipping insertion in model container [2022-07-20 00:04:30,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:04:30,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:04:30,406 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-20 00:04:30,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:04:30,641 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:04:30,712 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-20 00:04:30,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:04:30,794 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:04:30,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30 WrapperNode [2022-07-20 00:04:30,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:04:30,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:04:30,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:04:30,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:04:30,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,883 INFO L137 Inliner]: procedures = 117, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 863 [2022-07-20 00:04:30,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:04:30,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:04:30,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:04:30,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:04:30,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:04:30,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:04:30,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:04:30,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:04:30,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (1/1) ... [2022-07-20 00:04:30,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:04:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:30,999 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-20 00:04:31,035 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-20 00:04:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-20 00:04:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-20 00:04:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:04:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:04:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 00:04:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-20 00:04:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-20 00:04:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-20 00:04:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-20 00:04:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-20 00:04:31,053 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-20 00:04:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-20 00:04:31,053 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-20 00:04:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-20 00:04:31,053 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-20 00:04:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-20 00:04:31,053 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-20 00:04:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:04:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:04:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-20 00:04:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-20 00:04:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-20 00:04:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-20 00:04:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 00:04:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 00:04:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-20 00:04:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-20 00:04:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 00:04:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 00:04:31,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 00:04:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-20 00:04:31,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-20 00:04:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-20 00:04:31,055 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-20 00:04:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-20 00:04:31,056 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-20 00:04:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:04:31,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:04:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:04:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:04:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-20 00:04:31,056 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-20 00:04:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 00:04:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-20 00:04:31,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-20 00:04:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:04:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 00:04:31,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 00:04:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-20 00:04:31,057 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-20 00:04:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-20 00:04:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-20 00:04:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-20 00:04:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-20 00:04:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:04:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-20 00:04:31,059 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-20 00:04:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:04:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-20 00:04:31,059 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-20 00:04:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-20 00:04:31,059 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-20 00:04:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-20 00:04:31,060 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-20 00:04:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 00:04:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-20 00:04:31,060 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-20 00:04:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 00:04:31,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 00:04:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-20 00:04:31,061 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-20 00:04:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:04:31,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:04:31,318 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:04:31,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:04:31,468 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:04:31,805 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:04:31,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:04:31,812 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:04:31,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:04:31 BoogieIcfgContainer [2022-07-20 00:04:31,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:04:31,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:04:31,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:04:31,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:04:31,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:04:30" (1/3) ... [2022-07-20 00:04:31,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1739de8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:04:31, skipping insertion in model container [2022-07-20 00:04:31,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:30" (2/3) ... [2022-07-20 00:04:31,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1739de8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:04:31, skipping insertion in model container [2022-07-20 00:04:31,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:04:31" (3/3) ... [2022-07-20 00:04:31,828 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-20 00:04:31,839 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:04:31,840 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:04:31,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:04:31,886 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@670d4320, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73a075b2 [2022-07-20 00:04:31,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:04:31,890 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-20 00:04:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 00:04:31,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:31,902 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-20 00:04:31,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 863061951, now seen corresponding path program 1 times [2022-07-20 00:04:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:31,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892916958] [2022-07-20 00:04:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 00:04:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,227 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-20 00:04:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:32,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892916958] [2022-07-20 00:04:32,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892916958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:32,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:32,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:04:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586267111] [2022-07-20 00:04:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:32,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:04:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:32,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:04:32,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:04:32,268 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-20 00:04:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:32,737 INFO L93 Difference]: Finished difference Result 776 states and 1124 transitions. [2022-07-20 00:04:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:04:32,744 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-20 00:04:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:32,763 INFO L225 Difference]: With dead ends: 776 [2022-07-20 00:04:32,763 INFO L226 Difference]: Without dead ends: 367 [2022-07-20 00:04:32,776 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-20 00:04:32,780 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 544 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:32,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 744 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 00:04:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-20 00:04:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 277. [2022-07-20 00:04:32,828 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-20 00:04:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 358 transitions. [2022-07-20 00:04:32,831 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 358 transitions. Word has length 39 [2022-07-20 00:04:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:32,831 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 358 transitions. [2022-07-20 00:04:32,832 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-20 00:04:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 358 transitions. [2022-07-20 00:04:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 00:04:32,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:32,835 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-20 00:04:32,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:04:32,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1622348299, now seen corresponding path program 1 times [2022-07-20 00:04:32,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:32,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623851871] [2022-07-20 00:04:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 00:04:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:04:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:32,924 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-20 00:04:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:32,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623851871] [2022-07-20 00:04:32,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623851871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:32,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:32,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:04:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118193080] [2022-07-20 00:04:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:32,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:04:32,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:04:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:04:32,928 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-20 00:04:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:33,436 INFO L93 Difference]: Finished difference Result 796 states and 1053 transitions. [2022-07-20 00:04:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:04:33,437 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-20 00:04:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:33,440 INFO L225 Difference]: With dead ends: 796 [2022-07-20 00:04:33,440 INFO L226 Difference]: Without dead ends: 526 [2022-07-20 00:04:33,441 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-20 00:04:33,442 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 386 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:33,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 894 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 00:04:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-20 00:04:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 395. [2022-07-20 00:04:33,474 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-20 00:04:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 511 transitions. [2022-07-20 00:04:33,476 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 511 transitions. Word has length 57 [2022-07-20 00:04:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:33,476 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 511 transitions. [2022-07-20 00:04:33,476 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-20 00:04:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 511 transitions. [2022-07-20 00:04:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 00:04:33,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:33,478 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-20 00:04:33,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:04:33,479 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1789312131, now seen corresponding path program 1 times [2022-07-20 00:04:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:33,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416521026] [2022-07-20 00:04:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 00:04:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 00:04:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:33,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:33,582 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-20 00:04:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:33,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416521026] [2022-07-20 00:04:33,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416521026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:33,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:33,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:04:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711623581] [2022-07-20 00:04:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:33,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:04:33,584 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-20 00:04:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:34,074 INFO L93 Difference]: Finished difference Result 917 states and 1213 transitions. [2022-07-20 00:04:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:04:34,074 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-20 00:04:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:34,077 INFO L225 Difference]: With dead ends: 917 [2022-07-20 00:04:34,077 INFO L226 Difference]: Without dead ends: 539 [2022-07-20 00:04:34,078 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-20 00:04:34,079 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 524 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:34,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1115 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 00:04:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-07-20 00:04:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 405. [2022-07-20 00:04:34,097 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-20 00:04:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 518 transitions. [2022-07-20 00:04:34,099 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 518 transitions. Word has length 58 [2022-07-20 00:04:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:34,099 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 518 transitions. [2022-07-20 00:04:34,100 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-20 00:04:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 518 transitions. [2022-07-20 00:04:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 00:04:34,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:34,101 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-20 00:04:34,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:04:34,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash 967197344, now seen corresponding path program 1 times [2022-07-20 00:04:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:34,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794499652] [2022-07-20 00:04:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:04:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:04:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,176 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-20 00:04:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:34,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794499652] [2022-07-20 00:04:34,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794499652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:34,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:34,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:04:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103847067] [2022-07-20 00:04:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:34,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:34,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:34,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:04:34,178 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-20 00:04:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:34,605 INFO L93 Difference]: Finished difference Result 937 states and 1222 transitions. [2022-07-20 00:04:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:04:34,606 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-20 00:04:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:34,609 INFO L225 Difference]: With dead ends: 937 [2022-07-20 00:04:34,609 INFO L226 Difference]: Without dead ends: 549 [2022-07-20 00:04:34,610 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-20 00:04:34,611 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:34,611 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.3s Time] [2022-07-20 00:04:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-07-20 00:04:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 415. [2022-07-20 00:04:34,628 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-20 00:04:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 525 transitions. [2022-07-20 00:04:34,630 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 525 transitions. Word has length 56 [2022-07-20 00:04:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:34,630 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 525 transitions. [2022-07-20 00:04:34,630 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-20 00:04:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 525 transitions. [2022-07-20 00:04:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 00:04:34,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:34,632 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-20 00:04:34,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:04:34,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:34,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash 118188198, now seen corresponding path program 1 times [2022-07-20 00:04:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:34,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105133018] [2022-07-20 00:04:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:04:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:04:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:34,711 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-20 00:04:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:34,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105133018] [2022-07-20 00:04:34,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105133018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:34,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:34,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:04:34,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626142119] [2022-07-20 00:04:34,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:34,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:34,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:34,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:04:34,713 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-20 00:04:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:35,456 INFO L93 Difference]: Finished difference Result 1487 states and 1927 transitions. [2022-07-20 00:04:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:04:35,457 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-20 00:04:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:35,462 INFO L225 Difference]: With dead ends: 1487 [2022-07-20 00:04:35,462 INFO L226 Difference]: Without dead ends: 1089 [2022-07-20 00:04:35,463 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-20 00:04:35,465 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 951 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1291 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:35,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1291 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 00:04:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-07-20 00:04:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 805. [2022-07-20 00:04:35,503 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-20 00:04:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1032 transitions. [2022-07-20 00:04:35,506 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1032 transitions. Word has length 55 [2022-07-20 00:04:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:35,506 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1032 transitions. [2022-07-20 00:04:35,506 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-20 00:04:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1032 transitions. [2022-07-20 00:04:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 00:04:35,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:35,508 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-20 00:04:35,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:04:35,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:35,508 INFO L85 PathProgramCache]: Analyzing trace with hash -943497047, now seen corresponding path program 1 times [2022-07-20 00:04:35,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:35,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739202109] [2022-07-20 00:04:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:35,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 00:04:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:04:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:35,609 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-20 00:04:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:35,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739202109] [2022-07-20 00:04:35,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739202109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:35,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:35,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:04:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648553055] [2022-07-20 00:04:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:35,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:35,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:35,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:04:35,627 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-20 00:04:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:36,071 INFO L93 Difference]: Finished difference Result 1705 states and 2210 transitions. [2022-07-20 00:04:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:04:36,072 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-20 00:04:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:36,075 INFO L225 Difference]: With dead ends: 1705 [2022-07-20 00:04:36,075 INFO L226 Difference]: Without dead ends: 917 [2022-07-20 00:04:36,076 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-20 00:04:36,077 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-20 00:04:36,077 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-20 00:04:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-07-20 00:04:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 719. [2022-07-20 00:04:36,127 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-20 00:04:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 912 transitions. [2022-07-20 00:04:36,130 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 912 transitions. Word has length 57 [2022-07-20 00:04:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:36,130 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 912 transitions. [2022-07-20 00:04:36,130 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-20 00:04:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 912 transitions. [2022-07-20 00:04:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-20 00:04:36,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:36,132 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-20 00:04:36,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:04:36,132 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1665561776, now seen corresponding path program 1 times [2022-07-20 00:04:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:36,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24973904] [2022-07-20 00:04:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 00:04:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:04:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:04:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,254 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-20 00:04:36,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:36,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24973904] [2022-07-20 00:04:36,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24973904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:36,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838581746] [2022-07-20 00:04:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:36,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:36,257 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-20 00:04:36,295 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-20 00:04:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:36,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 00:04:36,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:36,528 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-20 00:04:36,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:04:36,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838581746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:36,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:04:36,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-07-20 00:04:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037968792] [2022-07-20 00:04:36,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:36,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:36,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:36,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-20 00:04:36,530 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-20 00:04:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:36,688 INFO L93 Difference]: Finished difference Result 1747 states and 2216 transitions. [2022-07-20 00:04:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 00:04:36,689 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-20 00:04:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:36,693 INFO L225 Difference]: With dead ends: 1747 [2022-07-20 00:04:36,693 INFO L226 Difference]: Without dead ends: 1052 [2022-07-20 00:04:36,694 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-20 00:04:36,695 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-20 00:04:36,695 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-20 00:04:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-20 00:04:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2022-07-20 00:04:36,722 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-20 00:04:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1281 transitions. [2022-07-20 00:04:36,726 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1281 transitions. Word has length 67 [2022-07-20 00:04:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:36,726 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1281 transitions. [2022-07-20 00:04:36,726 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-20 00:04:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1281 transitions. [2022-07-20 00:04:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 00:04:36,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:36,728 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-20 00:04:36,762 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-20 00:04:36,947 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-20 00:04:36,948 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2022790021, now seen corresponding path program 1 times [2022-07-20 00:04:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156347553] [2022-07-20 00:04:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:04:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:04:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 00:04:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,112 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-20 00:04:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:37,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156347553] [2022-07-20 00:04:37,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156347553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:37,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393865052] [2022-07-20 00:04:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:37,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:37,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:37,115 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-20 00:04:37,146 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-20 00:04:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 00:04:37,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:37,391 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-20 00:04:37,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:04:37,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393865052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:37,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:04:37,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-20 00:04:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601336304] [2022-07-20 00:04:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:37,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:04:37,393 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-20 00:04:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:37,588 INFO L93 Difference]: Finished difference Result 2325 states and 2960 transitions. [2022-07-20 00:04:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 00:04:37,588 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-20 00:04:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:37,595 INFO L225 Difference]: With dead ends: 2325 [2022-07-20 00:04:37,595 INFO L226 Difference]: Without dead ends: 1344 [2022-07-20 00:04:37,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 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-20 00:04:37,598 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 337 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:37,599 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.1s Time] [2022-07-20 00:04:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-07-20 00:04:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1289. [2022-07-20 00:04:37,642 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-20 00:04:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-20 00:04:37,647 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 68 [2022-07-20 00:04:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:37,648 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-20 00:04:37,648 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-20 00:04:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-20 00:04:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 00:04:37,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:37,650 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-20 00:04:37,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 00:04:37,867 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-20 00:04:37,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:37,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2110117865, now seen corresponding path program 1 times [2022-07-20 00:04:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525654699] [2022-07-20 00:04:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:37,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:37,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 00:04:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:38,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:04:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:38,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 00:04:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:38,035 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-20 00:04:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:38,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525654699] [2022-07-20 00:04:38,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525654699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:38,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884543411] [2022-07-20 00:04:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:38,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:38,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:38,037 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-20 00:04:38,039 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-20 00:04:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:38,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 00:04:38,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:38,288 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-20 00:04:38,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:04:38,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884543411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:38,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:04:38,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-20 00:04:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581792532] [2022-07-20 00:04:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:38,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:38,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:04:38,290 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-20 00:04:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:38,456 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-20 00:04:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 00:04:38,457 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-20 00:04:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:38,462 INFO L225 Difference]: With dead ends: 2893 [2022-07-20 00:04:38,462 INFO L226 Difference]: Without dead ends: 1628 [2022-07-20 00:04:38,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 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-20 00:04:38,465 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-20 00:04:38,465 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-20 00:04:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-20 00:04:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-20 00:04:38,498 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-20 00:04:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-20 00:04:38,502 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 69 [2022-07-20 00:04:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:38,502 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-20 00:04:38,502 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-20 00:04:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-20 00:04:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 00:04:38,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:38,504 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-20 00:04:38,522 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-20 00:04:38,722 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-20 00:04:38,723 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:38,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1874499426, now seen corresponding path program 1 times [2022-07-20 00:04:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:38,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882950186] [2022-07-20 00:04:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:04:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 00:04:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:04:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,320 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-20 00:04:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882950186] [2022-07-20 00:04:39,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882950186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855418588] [2022-07-20 00:04:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:39,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:39,323 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-20 00:04:39,343 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-20 00:04:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:39,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 00:04:39,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:39,594 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-20 00:04:39,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:04:39,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855418588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:39,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:04:39,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-20 00:04:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300652578] [2022-07-20 00:04:39,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:39,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:04:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:04:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:04:39,597 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-20 00:04:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:39,760 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-20 00:04:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 00:04:39,760 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-20 00:04:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:39,766 INFO L225 Difference]: With dead ends: 2893 [2022-07-20 00:04:39,766 INFO L226 Difference]: Without dead ends: 1628 [2022-07-20 00:04:39,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-20 00:04:39,769 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-20 00:04:39,770 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-20 00:04:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-20 00:04:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-20 00:04:39,805 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-20 00:04:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-20 00:04:39,813 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 70 [2022-07-20 00:04:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:39,814 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-20 00:04:39,814 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-20 00:04:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-20 00:04:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-20 00:04:39,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:39,816 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-20 00:04:39,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-20 00:04:40,031 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-20 00:04:40,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:40,032 INFO L85 PathProgramCache]: Analyzing trace with hash -628405765, now seen corresponding path program 1 times [2022-07-20 00:04:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:40,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714786339] [2022-07-20 00:04:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:04:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-20 00:04:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 00:04:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,208 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-20 00:04:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:40,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714786339] [2022-07-20 00:04:40,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714786339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:40,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:40,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:04:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328316846] [2022-07-20 00:04:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:40,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:04:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:04:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:04:40,210 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-20 00:04:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:40,684 INFO L93 Difference]: Finished difference Result 3232 states and 4215 transitions. [2022-07-20 00:04:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:04:40,685 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-20 00:04:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:40,691 INFO L225 Difference]: With dead ends: 3232 [2022-07-20 00:04:40,691 INFO L226 Difference]: Without dead ends: 1967 [2022-07-20 00:04:40,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:04:40,694 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 458 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1007 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:40,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1007 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 00:04:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-07-20 00:04:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1610. [2022-07-20 00:04:40,738 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-20 00:04:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2058 transitions. [2022-07-20 00:04:40,742 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2058 transitions. Word has length 75 [2022-07-20 00:04:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:40,742 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2058 transitions. [2022-07-20 00:04:40,742 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-20 00:04:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2058 transitions. [2022-07-20 00:04:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 00:04:40,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:40,744 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-20 00:04:40,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 00:04:40,745 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1055310527, now seen corresponding path program 1 times [2022-07-20 00:04:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:40,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592420754] [2022-07-20 00:04:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:04:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 00:04:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:04:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:04:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:40,880 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-20 00:04:40,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:40,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592420754] [2022-07-20 00:04:40,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592420754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382093794] [2022-07-20 00:04:40,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:40,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:40,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:40,883 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-20 00:04:40,884 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-20 00:04:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:41,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 00:04:41,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:41,179 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-20 00:04:41,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:04:41,340 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-20 00:04:41,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382093794] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:04:41,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:04:41,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-20 00:04:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926148691] [2022-07-20 00:04:41,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:04:41,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 00:04:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:41,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 00:04:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-20 00:04:41,342 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-20 00:04:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:44,660 INFO L93 Difference]: Finished difference Result 4116 states and 5283 transitions. [2022-07-20 00:04:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 00:04:44,660 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-20 00:04:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:44,668 INFO L225 Difference]: With dead ends: 4116 [2022-07-20 00:04:44,668 INFO L226 Difference]: Without dead ends: 2509 [2022-07-20 00:04:44,671 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-20 00:04:44,672 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 2023 mSDsluCounter, 2884 mSDsCounter, 0 mSdLazyCounter, 4788 mSolverCounterSat, 897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 5685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 4788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:44,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 3384 Invalid, 5685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [897 Valid, 4788 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 00:04:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-20 00:04:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1918. [2022-07-20 00:04:44,726 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-20 00:04:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-20 00:04:44,730 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 82 [2022-07-20 00:04:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:44,730 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-20 00:04:44,730 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-20 00:04:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-20 00:04:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 00:04:44,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:44,733 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-20 00:04:44,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-20 00:04:44,947 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-20 00:04:44,948 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1436141603, now seen corresponding path program 1 times [2022-07-20 00:04:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:44,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52912901] [2022-07-20 00:04:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 00:04:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 00:04:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 00:04:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 00:04:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,076 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-20 00:04:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:45,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52912901] [2022-07-20 00:04:45,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52912901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:45,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023023410] [2022-07-20 00:04:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:45,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:45,078 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-20 00:04:45,079 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-20 00:04:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:45,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 00:04:45,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:45,371 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-20 00:04:45,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:04:45,517 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-20 00:04:45,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023023410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:04:45,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:04:45,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-20 00:04:45,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354071908] [2022-07-20 00:04:45,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:04:45,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 00:04:45,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:45,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 00:04:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-20 00:04:45,519 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-20 00:04:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:48,898 INFO L93 Difference]: Finished difference Result 4819 states and 6199 transitions. [2022-07-20 00:04:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 00:04:48,899 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-20 00:04:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:48,908 INFO L225 Difference]: With dead ends: 4819 [2022-07-20 00:04:48,908 INFO L226 Difference]: Without dead ends: 2904 [2022-07-20 00:04:48,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-07-20 00:04:48,912 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 2030 mSDsluCounter, 3290 mSDsCounter, 0 mSdLazyCounter, 5332 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3796 SdHoareTripleChecker+Invalid, 6217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 5332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:48,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 3796 Invalid, 6217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 5332 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 00:04:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2022-07-20 00:04:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1918. [2022-07-20 00:04:48,997 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-20 00:04:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-20 00:04:49,003 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 83 [2022-07-20 00:04:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:49,003 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-20 00:04:49,003 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-20 00:04:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-20 00:04:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-20 00:04:49,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:49,005 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-20 00:04:49,027 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-20 00:04:49,227 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-20 00:04:49,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1849722856, now seen corresponding path program 1 times [2022-07-20 00:04:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:49,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166466543] [2022-07-20 00:04:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:04:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 00:04:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 00:04:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 00:04:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,361 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-20 00:04:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:49,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166466543] [2022-07-20 00:04:49,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166466543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:49,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889263418] [2022-07-20 00:04:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:49,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:49,376 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-20 00:04:49,377 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-20 00:04:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:49,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 00:04:49,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:49,617 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-20 00:04:49,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:04:49,702 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-20 00:04:49,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889263418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:04:49,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:04:49,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-20 00:04:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182082707] [2022-07-20 00:04:49,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:04:49,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 00:04:49,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 00:04:49,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-20 00:04:49,704 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-20 00:04:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:52,562 INFO L93 Difference]: Finished difference Result 3746 states and 4789 transitions. [2022-07-20 00:04:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 00:04:52,563 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-20 00:04:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:52,581 INFO L225 Difference]: With dead ends: 3746 [2022-07-20 00:04:52,595 INFO L226 Difference]: Without dead ends: 1831 [2022-07-20 00:04:52,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=602, Invalid=2260, Unknown=0, NotChecked=0, Total=2862 [2022-07-20 00:04:52,599 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 1972 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 4893 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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-20 00:04:52,602 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-20 00:04:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-07-20 00:04:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1082. [2022-07-20 00:04:52,687 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-20 00:04:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1380 transitions. [2022-07-20 00:04:52,690 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1380 transitions. Word has length 84 [2022-07-20 00:04:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:52,690 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1380 transitions. [2022-07-20 00:04:52,690 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-20 00:04:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1380 transitions. [2022-07-20 00:04:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 00:04:52,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:52,693 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-20 00:04:52,725 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-20 00:04:52,894 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-20 00:04:52,894 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:52,895 INFO L85 PathProgramCache]: Analyzing trace with hash -345111867, now seen corresponding path program 1 times [2022-07-20 00:04:52,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850332192] [2022-07-20 00:04:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:04:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 00:04:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 00:04:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:52,975 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-20 00:04:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850332192] [2022-07-20 00:04:52,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850332192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:52,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:52,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:04:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365450655] [2022-07-20 00:04:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:52,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:04:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:04:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:04:52,977 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-20 00:04:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:53,488 INFO L93 Difference]: Finished difference Result 3120 states and 3980 transitions. [2022-07-20 00:04:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:04:53,489 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-20 00:04:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:53,495 INFO L225 Difference]: With dead ends: 3120 [2022-07-20 00:04:53,495 INFO L226 Difference]: Without dead ends: 2062 [2022-07-20 00:04:53,497 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-20 00:04:53,497 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 420 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:53,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1167 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 00:04:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-07-20 00:04:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1683. [2022-07-20 00:04:53,551 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-20 00:04:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2085 transitions. [2022-07-20 00:04:53,554 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2085 transitions. Word has length 88 [2022-07-20 00:04:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:53,555 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 2085 transitions. [2022-07-20 00:04:53,555 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-20 00:04:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2085 transitions. [2022-07-20 00:04:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 00:04:53,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:53,556 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-20 00:04:53,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 00:04:53,557 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1624461571, now seen corresponding path program 1 times [2022-07-20 00:04:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:53,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686269118] [2022-07-20 00:04:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:04:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:04:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:04:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:53,619 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-20 00:04:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686269118] [2022-07-20 00:04:53,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686269118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:04:53,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:04:53,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:04:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40235108] [2022-07-20 00:04:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:04:53,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:04:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:04:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:04:53,621 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-20 00:04:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:53,972 INFO L93 Difference]: Finished difference Result 3720 states and 4659 transitions. [2022-07-20 00:04:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:04:53,973 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-20 00:04:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:53,979 INFO L225 Difference]: With dead ends: 3720 [2022-07-20 00:04:53,979 INFO L226 Difference]: Without dead ends: 2060 [2022-07-20 00:04:53,981 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-20 00:04:53,982 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 116 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 930 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:53,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 930 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 00:04:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-07-20 00:04:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1684. [2022-07-20 00:04:54,036 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-20 00:04:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2086 transitions. [2022-07-20 00:04:54,039 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2086 transitions. Word has length 89 [2022-07-20 00:04:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:54,039 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 2086 transitions. [2022-07-20 00:04:54,040 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-20 00:04:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2086 transitions. [2022-07-20 00:04:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-20 00:04:54,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:54,041 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-20 00:04:54,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 00:04:54,042 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1363223741, now seen corresponding path program 1 times [2022-07-20 00:04:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:54,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448293204] [2022-07-20 00:04:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 00:04:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:04:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:04:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,150 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-20 00:04:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:54,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448293204] [2022-07-20 00:04:54,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448293204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:54,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927396324] [2022-07-20 00:04:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:54,168 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-20 00:04:54,169 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-20 00:04:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:54,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 00:04:54,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:54,360 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-20 00:04:54,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:04:54,412 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-20 00:04:54,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927396324] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:04:54,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:04:54,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-20 00:04:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105352081] [2022-07-20 00:04:54,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:04:54,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 00:04:54,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 00:04:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:04:54,414 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-20 00:04:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:55,049 INFO L93 Difference]: Finished difference Result 3723 states and 4664 transitions. [2022-07-20 00:04:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:04:55,050 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-20 00:04:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:55,056 INFO L225 Difference]: With dead ends: 3723 [2022-07-20 00:04:55,056 INFO L226 Difference]: Without dead ends: 2063 [2022-07-20 00:04:55,058 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-20 00:04:55,059 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 221 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:55,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1520 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 00:04:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-07-20 00:04:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1687. [2022-07-20 00:04:55,137 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-20 00:04:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2089 transitions. [2022-07-20 00:04:55,140 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2089 transitions. Word has length 90 [2022-07-20 00:04:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:55,141 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2089 transitions. [2022-07-20 00:04:55,141 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-20 00:04:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2089 transitions. [2022-07-20 00:04:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-20 00:04:55,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:55,143 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-20 00:04:55,163 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-20 00:04:55,355 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-20 00:04:55,356 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -142119037, now seen corresponding path program 2 times [2022-07-20 00:04:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:55,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627400310] [2022-07-20 00:04:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:55,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 00:04:55,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 00:04:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 00:04:55,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 00:04:55,487 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 00:04:55,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 00:04:55,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 00:04:55,491 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-20 00:04:55,494 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 00:04:55,510 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,514 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,514 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,514 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,514 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,515 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,517 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,517 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,517 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,517 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,517 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,518 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,518 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,518 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,518 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,518 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,518 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,518 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,531 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,531 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,531 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,531 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,531 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,531 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,533 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,533 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,533 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,533 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,533 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:04:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:04:55,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 12:04:55 BoogieIcfgContainer [2022-07-20 00:04:55,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 00:04:55,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 00:04:55,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 00:04:55,620 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 00:04:55,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:04:31" (3/4) ... [2022-07-20 00:04:55,623 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 00:04:55,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 00:04:55,623 INFO L158 Benchmark]: Toolchain (without parser) took 25586.19ms. Allocated memory was 90.2MB in the beginning and 352.3MB in the end (delta: 262.1MB). Free memory was 68.5MB in the beginning and 114.2MB in the end (delta: -45.7MB). Peak memory consumption was 216.7MB. Max. memory is 16.1GB. [2022-07-20 00:04:55,624 INFO L158 Benchmark]: CDTParser took 3.57ms. Allocated memory is still 90.2MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 00:04:55,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.87ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 68.2MB in the beginning and 71.6MB in the end (delta: -3.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2022-07-20 00:04:55,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.41ms. Allocated memory is still 111.1MB. Free memory was 71.6MB in the beginning and 65.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 00:04:55,625 INFO L158 Benchmark]: Boogie Preprocessor took 86.04ms. Allocated memory is still 111.1MB. Free memory was 65.8MB in the beginning and 60.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 00:04:55,625 INFO L158 Benchmark]: RCFGBuilder took 841.45ms. Allocated memory is still 111.1MB. Free memory was 59.5MB in the beginning and 58.1MB in the end (delta: 1.5MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2022-07-20 00:04:55,625 INFO L158 Benchmark]: TraceAbstraction took 23804.01ms. Allocated memory was 111.1MB in the beginning and 352.3MB in the end (delta: 241.2MB). Free memory was 57.6MB in the beginning and 114.2MB in the end (delta: -56.7MB). Peak memory consumption was 185.0MB. Max. memory is 16.1GB. [2022-07-20 00:04:55,625 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 352.3MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 00:04:55,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.57ms. Allocated memory is still 90.2MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.87ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 68.2MB in the beginning and 71.6MB in the end (delta: -3.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.41ms. Allocated memory is still 111.1MB. Free memory was 71.6MB in the beginning and 65.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.04ms. Allocated memory is still 111.1MB. Free memory was 65.8MB in the beginning and 60.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 841.45ms. Allocated memory is still 111.1MB. Free memory was 59.5MB in the beginning and 58.1MB in the end (delta: 1.5MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23804.01ms. Allocated memory was 111.1MB in the beginning and 352.3MB in the end (delta: 241.2MB). Free memory was 57.6MB in the beginning and 114.2MB in the end (delta: -56.7MB). Peak memory consumption was 185.0MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 352.3MB. Free memory is still 114.2MB. 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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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.6s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12687 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12313 mSDsluCounter, 30652 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23538 mSDsCounter, 4237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20412 IncrementalHoareTripleChecker+Invalid, 24649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4237 mSolverCounterUnsat, 7114 mSDtfsCounter, 20412 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1441 GetRequests, 1120 SyntacticMatches, 4 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 3.7s 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, 3.3s 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-20 00:04:55,693 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-?-eb692b5 [2022-07-20 00:04:57,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:04:57,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:04:57,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:04:57,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:04:57,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:04:57,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:04:57,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:04:57,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:04:57,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:04:57,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:04:57,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:04:57,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:04:57,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:04:57,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:04:57,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:04:57,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:04:57,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:04:57,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:04:57,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:04:57,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:04:57,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:04:57,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:04:57,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:04:57,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:04:57,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:04:57,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:04:57,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:04:57,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:04:57,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:04:57,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:04:57,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:04:57,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:04:57,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:04:57,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:04:57,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:04:57,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:04:57,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:04:57,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:04:57,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:04:57,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:04:57,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:04:57,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-20 00:04:57,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:04:57,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:04:57,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:04:57,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:04:57,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:04:57,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:04:57,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:04:57,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:04:57,589 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:04:57,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:04:57,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:04:57,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:04:57,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:04:57,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:04:57,590 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 00:04:57,591 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 00:04:57,591 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 00:04:57,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:04:57,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:04:57,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:04:57,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:04:57,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:04:57,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:04:57,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:04:57,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:04:57,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:04:57,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:04:57,593 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 00:04:57,593 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 00:04:57,593 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:04:57,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:04:57,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:04:57,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 00:04:57,594 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-20 00:04:57,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:04:57,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:04:57,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:04:57,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:04:57,944 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:04:57,945 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-20 00:04:58,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d221cf10d/09dccc52f8824798bf988e90a7dde660/FLAG3dcd1ce48 [2022-07-20 00:04:58,569 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:04:58,570 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-20 00:04:58,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d221cf10d/09dccc52f8824798bf988e90a7dde660/FLAG3dcd1ce48 [2022-07-20 00:04:59,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d221cf10d/09dccc52f8824798bf988e90a7dde660 [2022-07-20 00:04:59,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:04:59,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:04:59,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:04:59,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:04:59,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:04:59,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:04:59" (1/1) ... [2022-07-20 00:04:59,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230a2d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:04:59, skipping insertion in model container [2022-07-20 00:04:59,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:04:59" (1/1) ... [2022-07-20 00:04:59,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:04:59,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:04:59,460 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-20 00:04:59,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:04:59,757 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 00:04:59,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:04:59,808 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-20 00:04:59,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:04:59,885 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:04:59,938 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-20 00:04:59,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:05:00,025 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:05:00,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00 WrapperNode [2022-07-20 00:05:00,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:05:00,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:05:00,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:05:00,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:05:00,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,118 INFO L137 Inliner]: procedures = 121, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 791 [2022-07-20 00:05:00,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:05:00,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:05:00,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:05:00,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:05:00,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:05:00,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:05:00,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:05:00,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:05:00,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (1/1) ... [2022-07-20 00:05:00,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:05:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:05:00,241 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-20 00:05:00,249 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-20 00:05:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-20 00:05:00,286 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-20 00:05:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-20 00:05:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-20 00:05:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 00:05:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:05:00,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:05:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-20 00:05:00,287 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-20 00:05:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-20 00:05:00,287 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-20 00:05:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-20 00:05:00,288 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-20 00:05:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-20 00:05:00,288 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-20 00:05:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-20 00:05:00,288 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-20 00:05:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-20 00:05:00,288 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-20 00:05:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:05:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-20 00:05:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-20 00:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-20 00:05:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-20 00:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 00:05:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 00:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-20 00:05:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-20 00:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 00:05:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 00:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-20 00:05:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-20 00:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-20 00:05:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-20 00:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-20 00:05:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-20 00:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:05:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:05:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-20 00:05:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-20 00:05:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 00:05:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-20 00:05:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-20 00:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 00:05:00,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 00:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-20 00:05:00,294 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-20 00:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-20 00:05:00,294 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-20 00:05:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-20 00:05:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-20 00:05:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-20 00:05:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-20 00:05:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 00:05:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:05:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-20 00:05:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-20 00:05:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:05:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-20 00:05:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-20 00:05:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 00:05:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-20 00:05:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-20 00:05:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-20 00:05:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-20 00:05:00,298 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-20 00:05:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-20 00:05:00,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 00:05:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 00:05:00,298 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-20 00:05:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-20 00:05:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:05:00,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:05:00,597 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:05:00,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:05:00,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:05:03,502 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:05:03,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:05:03,522 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:05:03,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:05:03 BoogieIcfgContainer [2022-07-20 00:05:03,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:05:03,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:05:03,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:05:03,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:05:03,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:04:59" (1/3) ... [2022-07-20 00:05:03,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93a6e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:05:03, skipping insertion in model container [2022-07-20 00:05:03,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:05:00" (2/3) ... [2022-07-20 00:05:03,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93a6e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:05:03, skipping insertion in model container [2022-07-20 00:05:03,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:05:03" (3/3) ... [2022-07-20 00:05:03,539 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-20 00:05:03,555 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:05:03,555 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:05:03,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:05:03,637 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@6feae770, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64394344 [2022-07-20 00:05:03,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:05:03,649 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-20 00:05:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 00:05:03,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:03,679 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-20 00:05:03,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -422849068, now seen corresponding path program 1 times [2022-07-20 00:05:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:03,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329661033] [2022-07-20 00:05:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:03,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:03,728 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-20 00:05:03,752 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-20 00:05:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:03,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 00:05:03,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:04,078 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-20 00:05:04,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:04,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:04,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329661033] [2022-07-20 00:05:04,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329661033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:04,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 00:05:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801299994] [2022-07-20 00:05:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:04,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 00:05:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 00:05:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:05:04,121 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-20 00:05:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:04,196 INFO L93 Difference]: Finished difference Result 758 states and 1077 transitions. [2022-07-20 00:05:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 00:05:04,199 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-20 00:05:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:04,209 INFO L225 Difference]: With dead ends: 758 [2022-07-20 00:05:04,210 INFO L226 Difference]: Without dead ends: 366 [2022-07-20 00:05:04,215 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-20 00:05:04,218 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-20 00:05:04,218 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-20 00:05:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-20 00:05:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-07-20 00:05:04,267 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-20 00:05:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 490 transitions. [2022-07-20 00:05:04,271 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 490 transitions. Word has length 39 [2022-07-20 00:05:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:04,272 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 490 transitions. [2022-07-20 00:05:04,273 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-20 00:05:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 490 transitions. [2022-07-20 00:05:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 00:05:04,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:04,275 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-20 00:05:04,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 00:05:04,493 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-20 00:05:04,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1341730321, now seen corresponding path program 1 times [2022-07-20 00:05:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:04,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989529922] [2022-07-20 00:05:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:04,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:04,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:04,496 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-20 00:05:04,499 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-20 00:05:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:04,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:05:04,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:04,797 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-20 00:05:04,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:05:04,871 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-20 00:05:04,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:04,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989529922] [2022-07-20 00:05:04,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989529922] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:05:04,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:05:04,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 00:05:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479659648] [2022-07-20 00:05:04,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:05:04,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:05:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:05:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:05:04,874 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-20 00:05:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:04,984 INFO L93 Difference]: Finished difference Result 728 states and 977 transitions. [2022-07-20 00:05:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:05:04,985 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-20 00:05:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:04,993 INFO L225 Difference]: With dead ends: 728 [2022-07-20 00:05:04,993 INFO L226 Difference]: Without dead ends: 369 [2022-07-20 00:05:04,998 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-20 00:05:04,998 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-20 00:05:04,999 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-20 00:05:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-20 00:05:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-07-20 00:05:05,017 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-20 00:05:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 493 transitions. [2022-07-20 00:05:05,019 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 493 transitions. Word has length 39 [2022-07-20 00:05:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:05,020 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 493 transitions. [2022-07-20 00:05:05,020 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-20 00:05:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 493 transitions. [2022-07-20 00:05:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 00:05:05,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:05,022 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-20 00:05:05,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 00:05:05,234 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-20 00:05:05,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash -376881154, now seen corresponding path program 2 times [2022-07-20 00:05:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:05,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75833234] [2022-07-20 00:05:05,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 00:05:05,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:05,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:05,238 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-20 00:05:05,245 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-20 00:05:05,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 00:05:05,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:05:05,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 00:05:05,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:05,439 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-20 00:05:05,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:05,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:05,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75833234] [2022-07-20 00:05:05,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75833234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:05,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:05,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 00:05:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093593142] [2022-07-20 00:05:05,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:05,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 00:05:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:05,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 00:05:05,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:05:05,441 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-20 00:05:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:05,475 INFO L93 Difference]: Finished difference Result 621 states and 819 transitions. [2022-07-20 00:05:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 00:05:05,476 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-20 00:05:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:05,477 INFO L225 Difference]: With dead ends: 621 [2022-07-20 00:05:05,478 INFO L226 Difference]: Without dead ends: 263 [2022-07-20 00:05:05,479 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-20 00:05:05,479 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-20 00:05:05,480 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-20 00:05:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-20 00:05:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-20 00:05:05,491 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-20 00:05:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2022-07-20 00:05:05,492 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 42 [2022-07-20 00:05:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:05,492 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2022-07-20 00:05:05,493 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-20 00:05:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2022-07-20 00:05:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 00:05:05,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:05,495 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-20 00:05:05,504 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-20 00:05:05,704 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-20 00:05:05,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2129106285, now seen corresponding path program 1 times [2022-07-20 00:05:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:05,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229313972] [2022-07-20 00:05:05,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:05,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:05,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:05,707 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-20 00:05:05,709 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-20 00:05:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:05,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 00:05:05,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:06,015 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-20 00:05:06,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:06,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:06,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229313972] [2022-07-20 00:05:06,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229313972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:06,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:06,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 00:05:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908199467] [2022-07-20 00:05:06,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:06,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 00:05:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:06,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 00:05:06,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:05:06,028 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-20 00:05:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:06,125 INFO L93 Difference]: Finished difference Result 626 states and 807 transitions. [2022-07-20 00:05:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 00:05:06,126 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-20 00:05:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:06,128 INFO L225 Difference]: With dead ends: 626 [2022-07-20 00:05:06,128 INFO L226 Difference]: Without dead ends: 374 [2022-07-20 00:05:06,128 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-20 00:05:06,129 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-20 00:05:06,129 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-20 00:05:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-20 00:05:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2022-07-20 00:05:06,142 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-20 00:05:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 479 transitions. [2022-07-20 00:05:06,143 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 479 transitions. Word has length 61 [2022-07-20 00:05:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:06,144 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 479 transitions. [2022-07-20 00:05:06,144 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-20 00:05:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 479 transitions. [2022-07-20 00:05:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 00:05:06,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:06,145 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-20 00:05:06,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 00:05:06,356 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-20 00:05:06,357 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:06,358 INFO L85 PathProgramCache]: Analyzing trace with hash 685608890, now seen corresponding path program 1 times [2022-07-20 00:05:06,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:06,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034761859] [2022-07-20 00:05:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:06,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:06,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:06,377 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-20 00:05:06,378 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-20 00:05:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:06,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:05:06,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:06,714 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-20 00:05:06,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:06,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034761859] [2022-07-20 00:05:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034761859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:06,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:06,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:05:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281623231] [2022-07-20 00:05:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:06,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:05:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:05:06,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:05:06,717 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-20 00:05:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:06,891 INFO L93 Difference]: Finished difference Result 1095 states and 1427 transitions. [2022-07-20 00:05:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:05:06,891 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-20 00:05:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:06,896 INFO L225 Difference]: With dead ends: 1095 [2022-07-20 00:05:06,896 INFO L226 Difference]: Without dead ends: 744 [2022-07-20 00:05:06,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:05:06,898 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 332 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 00:05:06,898 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-20 00:05:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-20 00:05:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 721. [2022-07-20 00:05:06,918 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-20 00:05:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 933 transitions. [2022-07-20 00:05:06,921 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 933 transitions. Word has length 59 [2022-07-20 00:05:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:06,921 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 933 transitions. [2022-07-20 00:05:06,921 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-20 00:05:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 933 transitions. [2022-07-20 00:05:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 00:05:06,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:06,923 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-20 00:05:06,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-20 00:05:07,134 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-20 00:05:07,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2003167721, now seen corresponding path program 1 times [2022-07-20 00:05:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:07,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119463276] [2022-07-20 00:05:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:07,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:07,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:07,140 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-20 00:05:07,142 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-20 00:05:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:07,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:05:07,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:07,411 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-20 00:05:07,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:07,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:07,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119463276] [2022-07-20 00:05:07,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119463276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:07,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:07,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:05:07,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168759909] [2022-07-20 00:05:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:07,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:05:07,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:05:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:05:07,412 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-20 00:05:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:07,501 INFO L93 Difference]: Finished difference Result 1454 states and 1889 transitions. [2022-07-20 00:05:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:05:07,501 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-20 00:05:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:07,504 INFO L225 Difference]: With dead ends: 1454 [2022-07-20 00:05:07,505 INFO L226 Difference]: Without dead ends: 753 [2022-07-20 00:05:07,506 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-20 00:05:07,507 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-20 00:05:07,507 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-20 00:05:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-07-20 00:05:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 729. [2022-07-20 00:05:07,536 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-20 00:05:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 935 transitions. [2022-07-20 00:05:07,539 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 935 transitions. Word has length 60 [2022-07-20 00:05:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:07,539 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 935 transitions. [2022-07-20 00:05:07,539 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-20 00:05:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 935 transitions. [2022-07-20 00:05:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 00:05:07,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:07,541 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-20 00:05:07,587 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-20 00:05:07,750 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-20 00:05:07,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash -524865236, now seen corresponding path program 1 times [2022-07-20 00:05:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:07,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978997913] [2022-07-20 00:05:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:07,753 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-20 00:05:07,755 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-20 00:05:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:07,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:05:07,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:08,085 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-20 00:05:08,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:08,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978997913] [2022-07-20 00:05:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978997913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:08,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:08,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:05:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665364026] [2022-07-20 00:05:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:08,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:05:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:08,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:05:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:05:08,087 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-20 00:05:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:08,224 INFO L93 Difference]: Finished difference Result 1470 states and 1889 transitions. [2022-07-20 00:05:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:05:08,224 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-20 00:05:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:08,228 INFO L225 Difference]: With dead ends: 1470 [2022-07-20 00:05:08,228 INFO L226 Difference]: Without dead ends: 761 [2022-07-20 00:05:08,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:05:08,230 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:05:08,230 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.1s Time] [2022-07-20 00:05:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-07-20 00:05:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 737. [2022-07-20 00:05:08,260 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-20 00:05:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 937 transitions. [2022-07-20 00:05:08,264 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 937 transitions. Word has length 62 [2022-07-20 00:05:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:08,264 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 937 transitions. [2022-07-20 00:05:08,264 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-20 00:05:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 937 transitions. [2022-07-20 00:05:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 00:05:08,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:08,266 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-20 00:05:08,289 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-20 00:05:08,476 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-20 00:05:08,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1732611677, now seen corresponding path program 1 times [2022-07-20 00:05:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:08,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145928647] [2022-07-20 00:05:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:08,487 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-20 00:05:08,488 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-20 00:05:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:08,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:05:08,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:08,814 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-20 00:05:08,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:08,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:08,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145928647] [2022-07-20 00:05:08,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145928647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:08,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:08,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:05:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553833679] [2022-07-20 00:05:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:08,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:05:08,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:08,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:05:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:05:08,816 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-20 00:05:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:08,930 INFO L93 Difference]: Finished difference Result 1403 states and 1785 transitions. [2022-07-20 00:05:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:05:08,931 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-20 00:05:08,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:08,934 INFO L225 Difference]: With dead ends: 1403 [2022-07-20 00:05:08,934 INFO L226 Difference]: Without dead ends: 686 [2022-07-20 00:05:08,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:05:08,936 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-20 00:05:08,937 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-20 00:05:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-07-20 00:05:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 668. [2022-07-20 00:05:08,959 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-20 00:05:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 839 transitions. [2022-07-20 00:05:08,962 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 839 transitions. Word has length 61 [2022-07-20 00:05:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:08,962 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 839 transitions. [2022-07-20 00:05:08,962 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-20 00:05:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 839 transitions. [2022-07-20 00:05:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 00:05:08,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:08,979 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-20 00:05:08,993 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-20 00:05:09,190 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-20 00:05:09,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:09,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1941224850, now seen corresponding path program 1 times [2022-07-20 00:05:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:09,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222486863] [2022-07-20 00:05:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:09,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:09,193 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-20 00:05:09,194 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-20 00:05:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:09,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 00:05:09,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:09,564 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-20 00:05:09,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:05:09,768 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-20 00:05:09,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222486863] [2022-07-20 00:05:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222486863] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 00:05:09,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:05:09,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2022-07-20 00:05:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948505943] [2022-07-20 00:05:09,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:09,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:05:09,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:05:09,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:05:09,770 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-20 00:05:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:10,668 INFO L93 Difference]: Finished difference Result 1622 states and 2039 transitions. [2022-07-20 00:05:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 00:05:10,669 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-20 00:05:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:10,673 INFO L225 Difference]: With dead ends: 1622 [2022-07-20 00:05:10,673 INFO L226 Difference]: Without dead ends: 981 [2022-07-20 00:05:10,675 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-20 00:05:10,675 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:05:10,676 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.6s Time] [2022-07-20 00:05:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-20 00:05:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 918. [2022-07-20 00:05:10,696 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-20 00:05:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1160 transitions. [2022-07-20 00:05:10,699 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1160 transitions. Word has length 71 [2022-07-20 00:05:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:10,699 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1160 transitions. [2022-07-20 00:05:10,699 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-20 00:05:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1160 transitions. [2022-07-20 00:05:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 00:05:10,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:10,701 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-20 00:05:10,719 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-20 00:05:10,912 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-20 00:05:10,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 644086264, now seen corresponding path program 1 times [2022-07-20 00:05:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:10,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410383360] [2022-07-20 00:05:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:10,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:10,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:10,915 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-20 00:05:10,918 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-20 00:05:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:11,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 00:05:11,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:11,313 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-20 00:05:11,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:05:11,517 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-20 00:05:11,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:11,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410383360] [2022-07-20 00:05:11,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410383360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:05:11,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:05:11,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-20 00:05:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213676505] [2022-07-20 00:05:11,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:05:11,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 00:05:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 00:05:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:05:11,519 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-20 00:05:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:13,001 INFO L93 Difference]: Finished difference Result 2134 states and 2693 transitions. [2022-07-20 00:05:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 00:05:13,001 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-20 00:05:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:13,006 INFO L225 Difference]: With dead ends: 2134 [2022-07-20 00:05:13,006 INFO L226 Difference]: Without dead ends: 1243 [2022-07-20 00:05:13,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-20 00:05:13,009 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 722 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:05:13,009 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.2s Time] [2022-07-20 00:05:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-07-20 00:05:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1178. [2022-07-20 00:05:13,055 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-20 00:05:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-20 00:05:13,058 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 72 [2022-07-20 00:05:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:13,059 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-20 00:05:13,059 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-20 00:05:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-20 00:05:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-20 00:05:13,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:13,063 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-20 00:05:13,088 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-20 00:05:13,273 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-20 00:05:13,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1082506311, now seen corresponding path program 1 times [2022-07-20 00:05:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:13,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266520105] [2022-07-20 00:05:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:13,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:13,277 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-20 00:05:13,279 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-20 00:05:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:13,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 00:05:13,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:13,824 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-20 00:05:13,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:05:15,491 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-20 00:05:15,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:15,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266520105] [2022-07-20 00:05:15,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266520105] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:05:15,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:05:15,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-20 00:05:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76920645] [2022-07-20 00:05:15,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:05:15,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 00:05:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:15,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 00:05:15,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:05:15,493 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-20 00:05:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:18,541 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-20 00:05:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 00:05:18,542 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-20 00:05:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:18,549 INFO L225 Difference]: With dead ends: 2654 [2022-07-20 00:05:18,549 INFO L226 Difference]: Without dead ends: 1503 [2022-07-20 00:05:18,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-20 00:05:18,553 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 764 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:05:18,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 2510 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 00:05:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-20 00:05:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-20 00:05:18,612 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-20 00:05:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-20 00:05:18,619 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 73 [2022-07-20 00:05:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:18,619 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-20 00:05:18,619 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-20 00:05:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-20 00:05:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 00:05:18,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:18,621 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-20 00:05:18,671 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-20 00:05:18,846 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-20 00:05:18,846 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:18,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:18,847 INFO L85 PathProgramCache]: Analyzing trace with hash -608187279, now seen corresponding path program 1 times [2022-07-20 00:05:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:18,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989699674] [2022-07-20 00:05:18,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:18,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:18,850 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-20 00:05:18,859 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-20 00:05:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:19,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 00:05:19,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:19,299 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-20 00:05:19,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:05:19,667 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-20 00:05:19,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:19,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989699674] [2022-07-20 00:05:19,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989699674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:05:19,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:05:19,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-20 00:05:19,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526389909] [2022-07-20 00:05:19,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:05:19,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 00:05:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:19,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 00:05:19,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:05:19,668 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-20 00:05:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:21,114 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-20 00:05:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 00:05:21,115 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-20 00:05:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:21,121 INFO L225 Difference]: With dead ends: 2654 [2022-07-20 00:05:21,121 INFO L226 Difference]: Without dead ends: 1503 [2022-07-20 00:05:21,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-20 00:05:21,126 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 774 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:05:21,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1869 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 00:05:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-20 00:05:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-20 00:05:21,185 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-20 00:05:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-20 00:05:21,189 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 74 [2022-07-20 00:05:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:21,190 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-20 00:05:21,190 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-20 00:05:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-20 00:05:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-20 00:05:21,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:21,192 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-20 00:05:21,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-20 00:05:21,403 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-20 00:05:21,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2022215437, now seen corresponding path program 1 times [2022-07-20 00:05:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:21,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019211144] [2022-07-20 00:05:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:21,408 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-20 00:05:21,409 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-20 00:05:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:21,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 00:05:21,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:21,766 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-20 00:05:21,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:21,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019211144] [2022-07-20 00:05:21,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019211144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:21,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:21,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 00:05:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504377915] [2022-07-20 00:05:21,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:21,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 00:05:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 00:05:21,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:05:21,767 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-20 00:05:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:21,944 INFO L93 Difference]: Finished difference Result 2624 states and 3365 transitions. [2022-07-20 00:05:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 00:05:21,945 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-20 00:05:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:21,956 INFO L225 Difference]: With dead ends: 2624 [2022-07-20 00:05:21,956 INFO L226 Difference]: Without dead ends: 1473 [2022-07-20 00:05:21,972 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-20 00:05:21,973 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-20 00:05:21,974 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-20 00:05:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-07-20 00:05:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1470. [2022-07-20 00:05:22,038 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-20 00:05:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1866 transitions. [2022-07-20 00:05:22,053 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1866 transitions. Word has length 79 [2022-07-20 00:05:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:22,054 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 1866 transitions. [2022-07-20 00:05:22,054 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-20 00:05:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1866 transitions. [2022-07-20 00:05:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-20 00:05:22,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:22,057 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-20 00:05:22,077 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-20 00:05:22,268 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-20 00:05:22,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1967013804, now seen corresponding path program 1 times [2022-07-20 00:05:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:22,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312315803] [2022-07-20 00:05:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:22,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:22,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:22,272 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-20 00:05:22,283 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-20 00:05:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:22,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 00:05:22,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:22,973 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-20 00:05:22,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:05:23,842 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-20 00:05:23,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312315803] [2022-07-20 00:05:23,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312315803] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:05:23,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:05:23,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-07-20 00:05:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408568403] [2022-07-20 00:05:23,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:05:23,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 00:05:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:23,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 00:05:23,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:05:23,844 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-20 00:05:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:25,907 INFO L93 Difference]: Finished difference Result 3170 states and 4014 transitions. [2022-07-20 00:05:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 00:05:25,908 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-20 00:05:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:25,914 INFO L225 Difference]: With dead ends: 3170 [2022-07-20 00:05:25,914 INFO L226 Difference]: Without dead ends: 1727 [2022-07-20 00:05:25,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-07-20 00:05:25,920 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 709 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:05:25,921 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.6s Time] [2022-07-20 00:05:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-07-20 00:05:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 412. [2022-07-20 00:05:25,978 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-20 00:05:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 502 transitions. [2022-07-20 00:05:25,980 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 502 transitions. Word has length 84 [2022-07-20 00:05:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:25,980 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 502 transitions. [2022-07-20 00:05:25,980 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-20 00:05:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 502 transitions. [2022-07-20 00:05:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 00:05:25,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:25,995 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-20 00:05:26,015 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-20 00:05:26,208 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-20 00:05:26,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash -446383630, now seen corresponding path program 1 times [2022-07-20 00:05:26,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:26,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392384899] [2022-07-20 00:05:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:26,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:26,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:26,212 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-20 00:05:26,218 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-20 00:05:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:05:26,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 00:05:26,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:05:26,483 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-20 00:05:26,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:05:26,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 00:05:26,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392384899] [2022-07-20 00:05:26,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392384899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:05:26,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:05:26,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 00:05:26,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934253037] [2022-07-20 00:05:26,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:05:26,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 00:05:26,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 00:05:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 00:05:26,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:05:26,485 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-20 00:05:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:05:26,613 INFO L93 Difference]: Finished difference Result 1001 states and 1214 transitions. [2022-07-20 00:05:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 00:05:26,614 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-20 00:05:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:05:26,616 INFO L225 Difference]: With dead ends: 1001 [2022-07-20 00:05:26,616 INFO L226 Difference]: Without dead ends: 616 [2022-07-20 00:05:26,617 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-20 00:05:26,618 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-20 00:05:26,618 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-20 00:05:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-07-20 00:05:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2022-07-20 00:05:26,678 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-20 00:05:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 731 transitions. [2022-07-20 00:05:26,679 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 731 transitions. Word has length 92 [2022-07-20 00:05:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:05:26,680 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 731 transitions. [2022-07-20 00:05:26,680 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-20 00:05:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 731 transitions. [2022-07-20 00:05:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-20 00:05:26,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:05:26,682 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-20 00:05:26,709 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-20 00:05:26,894 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-20 00:05:26,894 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:05:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:05:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1210197595, now seen corresponding path program 1 times [2022-07-20 00:05:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 00:05:26,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358540112] [2022-07-20 00:05:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:05:26,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 00:05:26,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 00:05:26,900 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-20 00:05:26,901 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-20 00:05:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 00:05:27,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 00:05:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 00:05:28,099 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 00:05:28,103 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 00:05:28,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 00:05:28,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 00:05:28,322 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-20 00:05:28,324 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:05:28,327 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 00:05:28,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,381 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,382 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,382 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,386 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,387 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,387 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,389 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,389 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,393 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,393 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,393 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,394 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,394 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,394 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,394 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,394 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,394 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,395 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,395 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,396 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,396 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,396 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,396 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,397 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,397 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,397 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,397 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,397 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,398 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,398 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,398 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,398 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,399 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,399 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,399 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,399 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,399 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,401 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,401 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,401 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,413 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,415 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,415 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,415 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,415 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,415 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,416 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,416 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,416 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,416 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,416 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,418 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,429 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,429 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,430 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,431 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,431 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,432 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,432 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,432 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,432 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,447 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,447 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,449 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,449 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,449 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-20 00:05:28,449 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-20 00:05:28,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 12:05:28 BoogieIcfgContainer [2022-07-20 00:05:28,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 00:05:28,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 00:05:28,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 00:05:28,588 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 00:05:28,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:05:03" (3/4) ... [2022-07-20 00:05:28,591 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 00:05:28,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 00:05:28,591 INFO L158 Benchmark]: Toolchain (without parser) took 29561.14ms. Allocated memory was 69.2MB in the beginning and 188.7MB in the end (delta: 119.5MB). Free memory was 45.0MB in the beginning and 70.8MB in the end (delta: -25.8MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2022-07-20 00:05:28,592 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 49.9MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 00:05:28,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 994.09ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 39.3MB in the end (delta: 5.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2022-07-20 00:05:28,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.90ms. Allocated memory is still 83.9MB. Free memory was 39.3MB in the beginning and 33.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 00:05:28,593 INFO L158 Benchmark]: Boogie Preprocessor took 83.62ms. Allocated memory is still 83.9MB. Free memory was 33.9MB in the beginning and 47.1MB in the end (delta: -13.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-20 00:05:28,593 INFO L158 Benchmark]: RCFGBuilder took 3327.50ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 47.1MB in the beginning and 64.7MB in the end (delta: -17.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-07-20 00:05:28,593 INFO L158 Benchmark]: TraceAbstraction took 25055.16ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 64.2MB in the beginning and 70.8MB in the end (delta: -6.6MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2022-07-20 00:05:28,593 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 188.7MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 00:05:28,599 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.18ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 49.9MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 994.09ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 39.3MB in the end (delta: 5.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.90ms. Allocated memory is still 83.9MB. Free memory was 39.3MB in the beginning and 33.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.62ms. Allocated memory is still 83.9MB. Free memory was 33.9MB in the beginning and 47.1MB in the end (delta: -13.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3327.50ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 47.1MB in the beginning and 64.7MB in the end (delta: -17.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25055.16ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 64.2MB in the beginning and 70.8MB in the end (delta: -6.6MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 188.7MB. Free memory is still 70.8MB. 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_#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 - 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 * 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: 24.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5496 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5457 mSDsluCounter, 21173 SdHoareTripleChecker+Invalid, 6.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, 3.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.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 2191 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.6s 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-20 00:05:28,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample