./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 791161d1 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-?-791161d [2022-07-23 00:19:10,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:19:10,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:19:10,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:19:10,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:19:10,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:19:10,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:19:10,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:19:10,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:19:10,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:19:10,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:19:10,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:19:10,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:19:10,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:19:10,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:19:10,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:19:10,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:19:10,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:19:10,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:19:10,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:19:10,312 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:19:10,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:19:10,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:19:10,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:19:10,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:19:10,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:19:10,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:19:10,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:19:10,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:19:10,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:19:10,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:19:10,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:19:10,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:19:10,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:19:10,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:19:10,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:19:10,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:19:10,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:19:10,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:19:10,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:19:10,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:19:10,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:19:10,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 00:19:10,342 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:19:10,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:19:10,343 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:19:10,343 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:19:10,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:19:10,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:19:10,344 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:19:10,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:19:10,344 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:19:10,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:19:10,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 00:19:10,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:19:10,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:19:10,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:19:10,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:19:10,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:19:10,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:19:10,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:19:10,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:19:10,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:19:10,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:19:10,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:19:10,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:19:10,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:19:10,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:19:10,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 00:19:10,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 00:19:10,348 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:19:10,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:19:10,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:19:10,348 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-23 00:19:10,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:19:10,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:19:10,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:19:10,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:19:10,557 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:19:10,557 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-23 00:19:10,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40603b4bc/4cf0477feb3c4b298a75fe2bc43b471f/FLAG494da1dc9 [2022-07-23 00:19:11,260 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:19:11,263 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-23 00:19:11,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40603b4bc/4cf0477feb3c4b298a75fe2bc43b471f/FLAG494da1dc9 [2022-07-23 00:19:11,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40603b4bc/4cf0477feb3c4b298a75fe2bc43b471f [2022-07-23 00:19:11,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:19:11,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:19:11,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:19:11,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:19:11,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:19:11,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:19:11" (1/1) ... [2022-07-23 00:19:11,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:11, skipping insertion in model container [2022-07-23 00:19:11,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:19:11" (1/1) ... [2022-07-23 00:19:11,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:19:11,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:19:11,948 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-23 00:19:12,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:19:12,150 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:19:12,208 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-23 00:19:12,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:19:12,307 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:19:12,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12 WrapperNode [2022-07-23 00:19:12,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:19:12,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:19:12,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:19:12,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:19:12,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,383 INFO L137 Inliner]: procedures = 117, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 863 [2022-07-23 00:19:12,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:19:12,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:19:12,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:19:12,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:19:12,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:19:12,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:19:12,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:19:12,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:19:12,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (1/1) ... [2022-07-23 00:19:12,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:19:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:12,588 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-23 00:19:12,635 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-23 00:19:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-23 00:19:12,679 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-23 00:19:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:19:12,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:19:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 00:19:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-23 00:19:12,680 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-23 00:19:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-23 00:19:12,680 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-23 00:19:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-23 00:19:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-23 00:19:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-23 00:19:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-23 00:19:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-23 00:19:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-23 00:19:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-23 00:19:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-23 00:19:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 00:19:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 00:19:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-23 00:19:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-23 00:19:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-23 00:19:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-23 00:19:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 00:19:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 00:19:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-23 00:19:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-23 00:19:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 00:19:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:19:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:19:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-23 00:19:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-23 00:19:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-23 00:19:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-23 00:19:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-23 00:19:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-23 00:19:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:19:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:19:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:19:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:19:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-23 00:19:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-23 00:19:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 00:19:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-23 00:19:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-23 00:19:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:19:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 00:19:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 00:19:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-23 00:19:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-23 00:19:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-23 00:19:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-23 00:19:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-23 00:19:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-23 00:19:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:19:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-23 00:19:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-23 00:19:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:19:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-23 00:19:12,692 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-23 00:19:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-23 00:19:12,693 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-23 00:19:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-23 00:19:12,693 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-23 00:19:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 00:19:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-23 00:19:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-23 00:19:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 00:19:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 00:19:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-23 00:19:12,695 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-23 00:19:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:19:12,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:19:12,978 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:19:12,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:19:13,132 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:19:13,551 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:19:13,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:19:13,564 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:19:13,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:19:13 BoogieIcfgContainer [2022-07-23 00:19:13,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:19:13,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:19:13,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:19:13,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:19:13,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:19:11" (1/3) ... [2022-07-23 00:19:13,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467cd3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:19:13, skipping insertion in model container [2022-07-23 00:19:13,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:12" (2/3) ... [2022-07-23 00:19:13,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467cd3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:19:13, skipping insertion in model container [2022-07-23 00:19:13,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:19:13" (3/3) ... [2022-07-23 00:19:13,577 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-23 00:19:13,593 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:19:13,593 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:19:13,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:19:13,668 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@a76290c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20ccced [2022-07-23 00:19:13,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:19:13,675 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-23 00:19:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 00:19:13,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:13,693 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-23 00:19:13,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash 863061951, now seen corresponding path program 1 times [2022-07-23 00:19:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588417240] [2022-07-23 00:19:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:13,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 00:19:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:14,224 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-23 00:19:14,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:14,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588417240] [2022-07-23 00:19:14,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588417240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:14,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:14,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:19:14,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065422647] [2022-07-23 00:19:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:14,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:14,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:14,270 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-23 00:19:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:14,831 INFO L93 Difference]: Finished difference Result 776 states and 1124 transitions. [2022-07-23 00:19:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:19:14,835 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-23 00:19:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:14,850 INFO L225 Difference]: With dead ends: 776 [2022-07-23 00:19:14,851 INFO L226 Difference]: Without dead ends: 367 [2022-07-23 00:19:14,860 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-23 00:19:14,870 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:14,871 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.4s Time] [2022-07-23 00:19:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-23 00:19:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 277. [2022-07-23 00:19:14,942 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-23 00:19:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 358 transitions. [2022-07-23 00:19:14,945 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 358 transitions. Word has length 39 [2022-07-23 00:19:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:14,946 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 358 transitions. [2022-07-23 00:19:14,946 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-23 00:19:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 358 transitions. [2022-07-23 00:19:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 00:19:14,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:14,950 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-23 00:19:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 00:19:14,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1622348299, now seen corresponding path program 1 times [2022-07-23 00:19:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300191396] [2022-07-23 00:19:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 00:19:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:19:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,175 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-23 00:19:15,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:15,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300191396] [2022-07-23 00:19:15,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300191396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:15,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:15,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:19:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218680911] [2022-07-23 00:19:15,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:15,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:15,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:15,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:15,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:15,179 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-23 00:19:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:15,821 INFO L93 Difference]: Finished difference Result 796 states and 1053 transitions. [2022-07-23 00:19:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:19:15,825 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-23 00:19:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:15,830 INFO L225 Difference]: With dead ends: 796 [2022-07-23 00:19:15,830 INFO L226 Difference]: Without dead ends: 526 [2022-07-23 00:19:15,832 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-23 00:19:15,833 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 386 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 899 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:15,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 899 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 00:19:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-23 00:19:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 395. [2022-07-23 00:19:15,864 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-23 00:19:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 511 transitions. [2022-07-23 00:19:15,867 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 511 transitions. Word has length 57 [2022-07-23 00:19:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:15,868 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 511 transitions. [2022-07-23 00:19:15,868 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-23 00:19:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 511 transitions. [2022-07-23 00:19:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 00:19:15,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:15,871 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-23 00:19:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 00:19:15,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1789312131, now seen corresponding path program 1 times [2022-07-23 00:19:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:15,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072897406] [2022-07-23 00:19:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 00:19:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:19:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,022 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-23 00:19:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:16,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072897406] [2022-07-23 00:19:16,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072897406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:16,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:16,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:19:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410314623] [2022-07-23 00:19:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:16,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:19:16,026 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-23 00:19:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:16,661 INFO L93 Difference]: Finished difference Result 917 states and 1213 transitions. [2022-07-23 00:19:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:19:16,662 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-23 00:19:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:16,666 INFO L225 Difference]: With dead ends: 917 [2022-07-23 00:19:16,666 INFO L226 Difference]: Without dead ends: 539 [2022-07-23 00:19:16,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-23 00:19:16,670 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 524 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:16,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1116 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 00:19:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-07-23 00:19:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 405. [2022-07-23 00:19:16,697 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-23 00:19:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 518 transitions. [2022-07-23 00:19:16,701 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 518 transitions. Word has length 58 [2022-07-23 00:19:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:16,701 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 518 transitions. [2022-07-23 00:19:16,702 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-23 00:19:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 518 transitions. [2022-07-23 00:19:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 00:19:16,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:16,704 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-23 00:19:16,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 00:19:16,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:16,706 INFO L85 PathProgramCache]: Analyzing trace with hash 967197344, now seen corresponding path program 1 times [2022-07-23 00:19:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:16,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821368088] [2022-07-23 00:19:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:19:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 00:19:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:16,810 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-23 00:19:16,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:16,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821368088] [2022-07-23 00:19:16,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821368088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:16,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:16,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:19:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491801155] [2022-07-23 00:19:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:16,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:19:16,814 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-23 00:19:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:17,250 INFO L93 Difference]: Finished difference Result 937 states and 1222 transitions. [2022-07-23 00:19:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:19:17,251 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-23 00:19:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:17,253 INFO L225 Difference]: With dead ends: 937 [2022-07-23 00:19:17,253 INFO L226 Difference]: Without dead ends: 549 [2022-07-23 00:19:17,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-23 00:19:17,256 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 659 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 973 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-23 00:19:17,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 973 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 00:19:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-07-23 00:19:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 415. [2022-07-23 00:19:17,275 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-23 00:19:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 525 transitions. [2022-07-23 00:19:17,278 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 525 transitions. Word has length 56 [2022-07-23 00:19:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:17,280 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 525 transitions. [2022-07-23 00:19:17,280 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-23 00:19:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 525 transitions. [2022-07-23 00:19:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 00:19:17,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:17,283 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-23 00:19:17,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 00:19:17,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 118188198, now seen corresponding path program 1 times [2022-07-23 00:19:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:17,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66920752] [2022-07-23 00:19:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:17,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:19:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:19:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:17,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:17,378 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-23 00:19:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:17,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66920752] [2022-07-23 00:19:17,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66920752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:17,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:17,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:19:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702967925] [2022-07-23 00:19:17,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:17,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:19:17,381 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-23 00:19:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:18,229 INFO L93 Difference]: Finished difference Result 1487 states and 1927 transitions. [2022-07-23 00:19:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 00:19:18,229 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-23 00:19:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:18,235 INFO L225 Difference]: With dead ends: 1487 [2022-07-23 00:19:18,235 INFO L226 Difference]: Without dead ends: 1089 [2022-07-23 00:19:18,237 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-23 00:19:18,237 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 951 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:18,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1296 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 00:19:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-07-23 00:19:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 805. [2022-07-23 00:19:18,286 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-23 00:19:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1032 transitions. [2022-07-23 00:19:18,313 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1032 transitions. Word has length 55 [2022-07-23 00:19:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:18,313 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1032 transitions. [2022-07-23 00:19:18,313 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-23 00:19:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1032 transitions. [2022-07-23 00:19:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 00:19:18,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:18,316 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-23 00:19:18,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 00:19:18,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash -943497047, now seen corresponding path program 1 times [2022-07-23 00:19:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:18,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537517139] [2022-07-23 00:19:18,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:18,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 00:19:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:19:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:18,438 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-23 00:19:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:18,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537517139] [2022-07-23 00:19:18,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537517139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:18,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:18,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:19:18,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984645998] [2022-07-23 00:19:18,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:18,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:19:18,441 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-23 00:19:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:18,905 INFO L93 Difference]: Finished difference Result 1705 states and 2210 transitions. [2022-07-23 00:19:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:19:18,905 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-23 00:19:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:18,911 INFO L225 Difference]: With dead ends: 1705 [2022-07-23 00:19:18,911 INFO L226 Difference]: Without dead ends: 917 [2022-07-23 00:19:18,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-23 00:19:18,915 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 661 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 933 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-23 00:19:18,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 933 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 00:19:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-07-23 00:19:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 719. [2022-07-23 00:19:18,939 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-23 00:19:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 912 transitions. [2022-07-23 00:19:18,942 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 912 transitions. Word has length 57 [2022-07-23 00:19:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:18,942 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 912 transitions. [2022-07-23 00:19:18,942 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-23 00:19:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 912 transitions. [2022-07-23 00:19:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 00:19:18,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:18,944 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-23 00:19:18,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 00:19:18,945 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1665561776, now seen corresponding path program 1 times [2022-07-23 00:19:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:18,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173096014] [2022-07-23 00:19:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-23 00:19:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:19:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 00:19:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,050 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-23 00:19:19,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:19,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173096014] [2022-07-23 00:19:19,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173096014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:19,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105056799] [2022-07-23 00:19:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:19,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:19,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:19,063 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-23 00:19:19,068 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-23 00:19:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 00:19:19,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:19,322 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-23 00:19:19,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:19,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105056799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:19,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:19:19,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-07-23 00:19:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255603016] [2022-07-23 00:19:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-23 00:19:19,324 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-23 00:19:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:19,477 INFO L93 Difference]: Finished difference Result 1747 states and 2216 transitions. [2022-07-23 00:19:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 00:19:19,477 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-23 00:19:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:19,481 INFO L225 Difference]: With dead ends: 1747 [2022-07-23 00:19:19,482 INFO L226 Difference]: Without dead ends: 1052 [2022-07-23 00:19:19,485 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-23 00:19:19,485 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-23 00:19:19,486 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-23 00:19:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-23 00:19:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2022-07-23 00:19:19,526 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-23 00:19:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1281 transitions. [2022-07-23 00:19:19,530 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1281 transitions. Word has length 67 [2022-07-23 00:19:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:19,531 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1281 transitions. [2022-07-23 00:19:19,532 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-23 00:19:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1281 transitions. [2022-07-23 00:19:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 00:19:19,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:19,534 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-23 00:19:19,557 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-23 00:19:19,752 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-23 00:19:19,752 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:19,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2022790021, now seen corresponding path program 1 times [2022-07-23 00:19:19,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:19,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587340492] [2022-07-23 00:19:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:19:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 00:19:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-23 00:19:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:19,874 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-23 00:19:19,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:19,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587340492] [2022-07-23 00:19:19,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587340492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:19,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208726619] [2022-07-23 00:19:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:19,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:19,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:19,876 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-23 00:19:19,894 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-23 00:19:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 00:19:20,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:20,142 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-23 00:19:20,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:20,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208726619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:20,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:19:20,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-23 00:19:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132770332] [2022-07-23 00:19:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:20,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-23 00:19:20,144 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-23 00:19:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:20,297 INFO L93 Difference]: Finished difference Result 2325 states and 2960 transitions. [2022-07-23 00:19:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 00:19:20,298 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-23 00:19:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:20,302 INFO L225 Difference]: With dead ends: 2325 [2022-07-23 00:19:20,302 INFO L226 Difference]: Without dead ends: 1344 [2022-07-23 00:19:20,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-23 00:19:20,305 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-23 00:19:20,305 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-23 00:19:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-07-23 00:19:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1289. [2022-07-23 00:19:20,346 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-23 00:19:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-23 00:19:20,350 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 68 [2022-07-23 00:19:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:20,351 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-23 00:19:20,351 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-23 00:19:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-23 00:19:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-23 00:19:20,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:20,353 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-23 00:19:20,372 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-23 00:19:20,572 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-23 00:19:20,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2110117865, now seen corresponding path program 1 times [2022-07-23 00:19:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:20,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410167719] [2022-07-23 00:19:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:20,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 00:19:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:19:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 00:19:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,701 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-23 00:19:20,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410167719] [2022-07-23 00:19:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410167719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841918522] [2022-07-23 00:19:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:20,704 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-23 00:19:20,705 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-23 00:19:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:20,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 00:19:20,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:20,946 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-23 00:19:20,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:20,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841918522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:20,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:19:20,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-23 00:19:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049335857] [2022-07-23 00:19:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:20,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-23 00:19:20,948 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-23 00:19:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:21,135 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-23 00:19:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 00:19:21,135 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-23 00:19:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:21,141 INFO L225 Difference]: With dead ends: 2893 [2022-07-23 00:19:21,141 INFO L226 Difference]: Without dead ends: 1628 [2022-07-23 00:19:21,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-23 00:19:21,144 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-23 00:19:21,145 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-23 00:19:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-23 00:19:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-23 00:19:21,185 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-23 00:19:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-23 00:19:21,190 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 69 [2022-07-23 00:19:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:21,190 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-23 00:19:21,190 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-23 00:19:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-23 00:19:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 00:19:21,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:21,192 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-23 00:19:21,212 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-23 00:19:21,406 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-23 00:19:21,407 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1874499426, now seen corresponding path program 1 times [2022-07-23 00:19:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:21,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729511507] [2022-07-23 00:19:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:19:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 00:19:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 00:19:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,509 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-23 00:19:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:21,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729511507] [2022-07-23 00:19:21,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729511507] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:21,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184494113] [2022-07-23 00:19:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:21,511 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-23 00:19:21,512 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-23 00:19:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:21,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 00:19:21,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:21,745 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-23 00:19:21,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184494113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:19:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-23 00:19:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780944515] [2022-07-23 00:19:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:21,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:19:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:19:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-23 00:19:21,747 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-23 00:19:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:21,924 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-23 00:19:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 00:19:21,925 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-23 00:19:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:21,934 INFO L225 Difference]: With dead ends: 2893 [2022-07-23 00:19:21,935 INFO L226 Difference]: Without dead ends: 1628 [2022-07-23 00:19:21,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-23 00:19:21,941 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-23 00:19:21,942 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-23 00:19:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-23 00:19:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-23 00:19:22,016 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-23 00:19:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-23 00:19:22,033 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 70 [2022-07-23 00:19:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:22,033 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-23 00:19:22,034 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-23 00:19:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-23 00:19:22,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-23 00:19:22,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:22,037 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-23 00:19:22,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 00:19:22,251 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-23 00:19:22,252 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash -628405765, now seen corresponding path program 1 times [2022-07-23 00:19:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:22,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343519510] [2022-07-23 00:19:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:19:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 00:19:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 00:19:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,308 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-23 00:19:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:22,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343519510] [2022-07-23 00:19:22,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343519510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:22,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:22,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:19:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858720103] [2022-07-23 00:19:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:22,310 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-23 00:19:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:22,731 INFO L93 Difference]: Finished difference Result 3232 states and 4215 transitions. [2022-07-23 00:19:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:19:22,731 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-23 00:19:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:22,737 INFO L225 Difference]: With dead ends: 3232 [2022-07-23 00:19:22,737 INFO L226 Difference]: Without dead ends: 1967 [2022-07-23 00:19:22,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:19:22,740 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:22,740 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.3s Time] [2022-07-23 00:19:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-07-23 00:19:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1610. [2022-07-23 00:19:22,786 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-23 00:19:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2058 transitions. [2022-07-23 00:19:22,789 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2058 transitions. Word has length 75 [2022-07-23 00:19:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:22,790 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2058 transitions. [2022-07-23 00:19:22,790 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-23 00:19:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2058 transitions. [2022-07-23 00:19:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 00:19:22,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:22,792 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-23 00:19:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 00:19:22,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1055310527, now seen corresponding path program 1 times [2022-07-23 00:19:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409105320] [2022-07-23 00:19:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:19:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 00:19:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 00:19:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 00:19:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:22,926 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-23 00:19:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:22,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409105320] [2022-07-23 00:19:22,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409105320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:22,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899137957] [2022-07-23 00:19:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:22,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:22,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:22,944 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-23 00:19:23,005 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-23 00:19:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:23,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 00:19:23,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:23,299 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-23 00:19:23,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:19:23,465 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-23 00:19:23,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899137957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:19:23,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:19:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-23 00:19:23,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244834307] [2022-07-23 00:19:23,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:19:23,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-23 00:19:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-23 00:19:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-23 00:19:23,469 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-23 00:19:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:30,132 INFO L93 Difference]: Finished difference Result 4116 states and 5283 transitions. [2022-07-23 00:19:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 00:19:30,133 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-23 00:19:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:30,162 INFO L225 Difference]: With dead ends: 4116 [2022-07-23 00:19:30,162 INFO L226 Difference]: Without dead ends: 2509 [2022-07-23 00:19:30,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-07-23 00:19:30,168 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 2023 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 4788 mSolverCounterSat, 897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 5685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 4788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:30,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 3370 Invalid, 5685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [897 Valid, 4788 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-23 00:19:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-23 00:19:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1918. [2022-07-23 00:19:30,354 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-23 00:19:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-23 00:19:30,361 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 82 [2022-07-23 00:19:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:30,362 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-23 00:19:30,375 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-23 00:19:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-23 00:19:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 00:19:30,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:30,379 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-23 00:19:30,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 00:19:30,579 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-23 00:19:30,580 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1436141603, now seen corresponding path program 1 times [2022-07-23 00:19:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:30,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550660065] [2022-07-23 00:19:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 00:19:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 00:19:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 00:19:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 00:19:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:30,836 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-23 00:19:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:30,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550660065] [2022-07-23 00:19:30,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550660065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:30,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058658846] [2022-07-23 00:19:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:30,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:30,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:30,840 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-23 00:19:30,902 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-23 00:19:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:31,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 00:19:31,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:31,417 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-23 00:19:31,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:19:31,735 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-23 00:19:31,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058658846] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:19:31,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:19:31,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-23 00:19:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908755954] [2022-07-23 00:19:31,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:19:31,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-23 00:19:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-23 00:19:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-23 00:19:31,748 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-23 00:19:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:35,468 INFO L93 Difference]: Finished difference Result 4819 states and 6199 transitions. [2022-07-23 00:19:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 00:19:35,469 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-23 00:19:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:35,477 INFO L225 Difference]: With dead ends: 4819 [2022-07-23 00:19:35,478 INFO L226 Difference]: Without dead ends: 2904 [2022-07-23 00:19:35,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-07-23 00:19:35,482 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 2030 mSDsluCounter, 3300 mSDsCounter, 0 mSdLazyCounter, 5335 mSolverCounterSat, 883 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 6218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 883 IncrementalHoareTripleChecker+Valid, 5335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:35,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 3807 Invalid, 6218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [883 Valid, 5335 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 00:19:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2022-07-23 00:19:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1918. [2022-07-23 00:19:35,551 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-23 00:19:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-23 00:19:35,555 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 83 [2022-07-23 00:19:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:35,555 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-23 00:19:35,555 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-23 00:19:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-23 00:19:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-23 00:19:35,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:35,558 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-23 00:19:35,576 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-23 00:19:35,775 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-23 00:19:35,775 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1849722856, now seen corresponding path program 1 times [2022-07-23 00:19:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:35,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357485059] [2022-07-23 00:19:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:19:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 00:19:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 00:19:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 00:19:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:35,930 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-23 00:19:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:35,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357485059] [2022-07-23 00:19:35,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357485059] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:35,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609604123] [2022-07-23 00:19:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:35,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:35,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:35,952 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-23 00:19:35,954 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-23 00:19:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:36,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 00:19:36,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:36,277 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-23 00:19:36,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:19:36,436 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-23 00:19:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609604123] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:19:36,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:19:36,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-23 00:19:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992894831] [2022-07-23 00:19:36,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:19:36,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-23 00:19:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:36,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-23 00:19:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-23 00:19:36,439 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-23 00:19:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:39,903 INFO L93 Difference]: Finished difference Result 3746 states and 4789 transitions. [2022-07-23 00:19:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 00:19:39,903 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-23 00:19:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:39,911 INFO L225 Difference]: With dead ends: 3746 [2022-07-23 00:19:39,913 INFO L226 Difference]: Without dead ends: 1831 [2022-07-23 00:19:39,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=602, Invalid=2260, Unknown=0, NotChecked=0, Total=2862 [2022-07-23 00:19:39,921 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 1972 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 4898 mSolverCounterSat, 891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 5789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 4898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:39,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 3444 Invalid, 5789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 4898 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 00:19:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-07-23 00:19:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1082. [2022-07-23 00:19:39,984 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-23 00:19:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1380 transitions. [2022-07-23 00:19:39,988 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1380 transitions. Word has length 84 [2022-07-23 00:19:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:39,989 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1380 transitions. [2022-07-23 00:19:39,989 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-23 00:19:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1380 transitions. [2022-07-23 00:19:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 00:19:39,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:39,995 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-23 00:19:40,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-23 00:19:40,226 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-23 00:19:40,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash -345111867, now seen corresponding path program 1 times [2022-07-23 00:19:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:40,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280136250] [2022-07-23 00:19:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:19:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 00:19:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 00:19:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:40,318 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-23 00:19:40,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:40,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280136250] [2022-07-23 00:19:40,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280136250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:40,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:40,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:19:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733200295] [2022-07-23 00:19:40,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:40,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:40,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:40,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:40,321 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-23 00:19:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:40,829 INFO L93 Difference]: Finished difference Result 3120 states and 3980 transitions. [2022-07-23 00:19:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:19:40,830 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-23 00:19:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:40,838 INFO L225 Difference]: With dead ends: 3120 [2022-07-23 00:19:40,839 INFO L226 Difference]: Without dead ends: 2062 [2022-07-23 00:19:40,843 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-23 00:19:40,844 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 420 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:40,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1170 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 00:19:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-07-23 00:19:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1683. [2022-07-23 00:19:40,956 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-23 00:19:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2085 transitions. [2022-07-23 00:19:40,960 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2085 transitions. Word has length 88 [2022-07-23 00:19:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:40,961 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 2085 transitions. [2022-07-23 00:19:40,961 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-23 00:19:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2085 transitions. [2022-07-23 00:19:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-23 00:19:40,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:40,964 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-23 00:19:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 00:19:40,964 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1624461571, now seen corresponding path program 1 times [2022-07-23 00:19:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:40,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277485331] [2022-07-23 00:19:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:19:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:19:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 00:19:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:41,178 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-23 00:19:41,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:41,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277485331] [2022-07-23 00:19:41,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277485331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:41,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:41,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:19:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857308512] [2022-07-23 00:19:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:41,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:41,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:41,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:41,181 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-23 00:19:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:41,741 INFO L93 Difference]: Finished difference Result 3720 states and 4659 transitions. [2022-07-23 00:19:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:19:41,741 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-23 00:19:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:41,765 INFO L225 Difference]: With dead ends: 3720 [2022-07-23 00:19:41,779 INFO L226 Difference]: Without dead ends: 2060 [2022-07-23 00:19:41,785 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-23 00:19:41,787 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 116 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:41,787 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.4s Time] [2022-07-23 00:19:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-07-23 00:19:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1684. [2022-07-23 00:19:41,994 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-23 00:19:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2086 transitions. [2022-07-23 00:19:42,016 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2086 transitions. Word has length 89 [2022-07-23 00:19:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:42,017 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 2086 transitions. [2022-07-23 00:19:42,017 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-23 00:19:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2086 transitions. [2022-07-23 00:19:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-23 00:19:42,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:42,020 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-23 00:19:42,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 00:19:42,021 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1363223741, now seen corresponding path program 1 times [2022-07-23 00:19:42,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:42,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93142884] [2022-07-23 00:19:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:42,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:19:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 00:19:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:19:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:19:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:19:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,277 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-23 00:19:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:19:42,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93142884] [2022-07-23 00:19:42,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93142884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:19:42,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026952210] [2022-07-23 00:19:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:19:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:42,296 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-23 00:19:42,335 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-23 00:19:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:42,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 00:19:42,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:42,686 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-23 00:19:42,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:19:42,795 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-23 00:19:42,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026952210] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:19:42,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:19:42,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-23 00:19:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421396628] [2022-07-23 00:19:42,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:19:42,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 00:19:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:19:42,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 00:19:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:19:42,799 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-23 00:19:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:44,304 INFO L93 Difference]: Finished difference Result 3723 states and 4664 transitions. [2022-07-23 00:19:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:19:44,305 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-23 00:19:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:44,315 INFO L225 Difference]: With dead ends: 3723 [2022-07-23 00:19:44,315 INFO L226 Difference]: Without dead ends: 2063 [2022-07-23 00:19:44,319 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-23 00:19:44,319 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 221 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:44,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1530 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-23 00:19:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-07-23 00:19:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1687. [2022-07-23 00:19:44,422 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-23 00:19:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2089 transitions. [2022-07-23 00:19:44,426 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2089 transitions. Word has length 90 [2022-07-23 00:19:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:44,427 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2089 transitions. [2022-07-23 00:19:44,428 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-23 00:19:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2089 transitions. [2022-07-23 00:19:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-23 00:19:44,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:44,431 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-23 00:19:44,465 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-23 00:19:44,649 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-23 00:19:44,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash -142119037, now seen corresponding path program 2 times [2022-07-23 00:19:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:19:44,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514666506] [2022-07-23 00:19:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:19:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 00:19:44,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 00:19:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 00:19:44,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 00:19:44,970 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 00:19:44,971 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-23 00:19:44,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 00:19:44,992 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-23 00:19:44,997 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 00:19:45,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,058 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,058 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,062 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,063 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,064 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,064 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,064 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,064 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,064 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,064 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,065 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,069 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,069 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,069 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,069 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,069 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,070 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,070 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,070 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,070 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,071 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,071 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,071 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,071 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,071 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,071 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,072 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,072 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,072 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,072 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,080 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,081 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,081 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,081 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,082 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,082 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,082 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,082 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,082 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,091 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,091 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,091 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,113 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,113 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:19:45,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:19:45,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 12:19:45 BoogieIcfgContainer [2022-07-23 00:19:45,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 00:19:45,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 00:19:45,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 00:19:45,326 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 00:19:45,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:19:13" (3/4) ... [2022-07-23 00:19:45,337 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 00:19:45,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 00:19:45,339 INFO L158 Benchmark]: Toolchain (without parser) took 33862.40ms. Allocated memory was 104.9MB in the beginning and 490.7MB in the end (delta: 385.9MB). Free memory was 74.0MB in the beginning and 243.1MB in the end (delta: -169.2MB). Peak memory consumption was 216.3MB. Max. memory is 16.1GB. [2022-07-23 00:19:45,339 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 00:19:45,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 827.81ms. Allocated memory was 104.9MB in the beginning and 163.6MB in the end (delta: 58.7MB). Free memory was 73.8MB in the beginning and 101.1MB in the end (delta: -27.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-23 00:19:45,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.20ms. Allocated memory is still 163.6MB. Free memory was 101.1MB in the beginning and 94.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 00:19:45,342 INFO L158 Benchmark]: Boogie Preprocessor took 140.33ms. Allocated memory is still 163.6MB. Free memory was 94.8MB in the beginning and 130.0MB in the end (delta: -35.2MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2022-07-23 00:19:45,342 INFO L158 Benchmark]: RCFGBuilder took 1037.37ms. Allocated memory is still 163.6MB. Free memory was 130.0MB in the beginning and 71.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-07-23 00:19:45,342 INFO L158 Benchmark]: TraceAbstraction took 31755.49ms. Allocated memory was 163.6MB in the beginning and 490.7MB in the end (delta: 327.2MB). Free memory was 70.2MB in the beginning and 243.1MB in the end (delta: -172.9MB). Peak memory consumption was 155.3MB. Max. memory is 16.1GB. [2022-07-23 00:19:45,351 INFO L158 Benchmark]: Witness Printer took 12.59ms. Allocated memory is still 490.7MB. Free memory is still 243.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 00:19:45,352 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 827.81ms. Allocated memory was 104.9MB in the beginning and 163.6MB in the end (delta: 58.7MB). Free memory was 73.8MB in the beginning and 101.1MB in the end (delta: -27.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.20ms. Allocated memory is still 163.6MB. Free memory was 101.1MB in the beginning and 94.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.33ms. Allocated memory is still 163.6MB. Free memory was 94.8MB in the beginning and 130.0MB in the end (delta: -35.2MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1037.37ms. Allocated memory is still 163.6MB. Free memory was 130.0MB in the beginning and 71.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31755.49ms. Allocated memory was 163.6MB in the beginning and 490.7MB in the end (delta: 327.2MB). Free memory was 70.2MB in the beginning and 243.1MB in the end (delta: -172.9MB). Peak memory consumption was 155.3MB. Max. memory is 16.1GB. * Witness Printer took 12.59ms. Allocated memory is still 490.7MB. Free memory is still 243.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * 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: 31.4s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12691 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12313 mSDsluCounter, 30655 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23537 mSDsCounter, 4231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20424 IncrementalHoareTripleChecker+Invalid, 24655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4231 mSolverCounterUnsat, 7118 mSDtfsCounter, 20424 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1441 GetRequests, 1120 SyntacticMatches, 4 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 4.5s 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: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 5565 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2110 ConstructedInterpolants, 0 QuantifiedInterpolants, 4250 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-23 00:19:45,484 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-?-791161d [2022-07-23 00:19:48,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:19:48,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:19:48,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:19:48,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:19:48,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:19:48,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:19:48,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:19:48,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:19:48,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:19:48,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:19:48,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:19:48,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:19:48,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:19:48,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:19:48,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:19:48,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:19:48,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:19:48,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:19:48,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:19:48,240 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:19:48,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:19:48,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:19:48,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:19:48,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:19:48,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:19:48,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:19:48,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:19:48,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:19:48,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:19:48,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:19:48,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:19:48,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:19:48,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:19:48,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:19:48,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:19:48,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:19:48,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:19:48,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:19:48,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:19:48,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:19:48,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:19:48,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-23 00:19:48,291 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:19:48,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:19:48,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:19:48,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:19:48,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:19:48,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:19:48,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:19:48,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:19:48,294 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:19:48,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:19:48,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:19:48,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:19:48,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:19:48,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:19:48,295 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 00:19:48,295 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 00:19:48,295 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 00:19:48,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:19:48,296 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:19:48,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:19:48,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:19:48,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:19:48,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:19:48,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:19:48,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:19:48,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:19:48,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:19:48,297 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 00:19:48,297 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 00:19:48,297 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:19:48,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:19:48,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:19:48,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 00:19:48,297 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-23 00:19:48,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:19:48,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:19:48,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:19:48,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:19:48,617 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:19:48,618 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-23 00:19:48,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704f0a847/c6ded91cc0544dd9bce020ca10d50e4c/FLAG665cbbf95 [2022-07-23 00:19:49,269 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:19:49,271 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-23 00:19:49,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704f0a847/c6ded91cc0544dd9bce020ca10d50e4c/FLAG665cbbf95 [2022-07-23 00:19:49,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704f0a847/c6ded91cc0544dd9bce020ca10d50e4c [2022-07-23 00:19:49,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:19:49,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:19:49,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:19:49,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:19:49,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:19:49,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:19:49" (1/1) ... [2022-07-23 00:19:49,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528e5332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:49, skipping insertion in model container [2022-07-23 00:19:49,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:19:49" (1/1) ... [2022-07-23 00:19:49,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:19:49,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:19:50,218 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-23 00:19:50,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:19:50,577 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 00:19:50,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:19:50,638 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-23 00:19:50,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:19:50,713 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:19:50,760 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-23 00:19:50,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:19:50,860 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:19:50,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50 WrapperNode [2022-07-23 00:19:50,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:19:50,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:19:50,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:19:50,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:19:50,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:50,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:50,989 INFO L137 Inliner]: procedures = 121, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 791 [2022-07-23 00:19:50,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:19:50,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:19:50,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:19:50,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:19:51,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:19:51,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:19:51,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:19:51,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:19:51,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (1/1) ... [2022-07-23 00:19:51,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:19:51,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:19:51,156 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-23 00:19:51,184 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-23 00:19:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-23 00:19:51,217 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-23 00:19:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 00:19:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-23 00:19:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 00:19:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:19:51,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:19:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-23 00:19:51,217 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-23 00:19:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-23 00:19:51,217 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-23 00:19:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-23 00:19:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-23 00:19:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-23 00:19:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-23 00:19:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-23 00:19:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-23 00:19:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-23 00:19:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-23 00:19:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 00:19:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 00:19:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-23 00:19:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-23 00:19:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-23 00:19:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-23 00:19:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 00:19:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 00:19:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-23 00:19:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-23 00:19:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:19:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:19:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-23 00:19:51,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-23 00:19:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-23 00:19:51,220 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-23 00:19:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-23 00:19:51,220 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-23 00:19:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:19:51,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:19:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:19:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:19:51,220 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-23 00:19:51,220 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-23 00:19:51,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 00:19:51,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-23 00:19:51,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-23 00:19:51,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:19:51,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 00:19:51,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 00:19:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-23 00:19:51,222 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-23 00:19:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-23 00:19:51,223 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-23 00:19:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-23 00:19:51,223 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-23 00:19:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-23 00:19:51,224 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-23 00:19:51,224 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 00:19:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-23 00:19:51,224 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-23 00:19:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-23 00:19:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-23 00:19:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-23 00:19:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-23 00:19:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 00:19:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 00:19:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-23 00:19:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-23 00:19:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:19:51,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:19:51,565 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:19:51,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:19:51,946 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:19:54,789 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:19:54,801 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:19:54,803 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:19:54,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:19:54 BoogieIcfgContainer [2022-07-23 00:19:54,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:19:54,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:19:54,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:19:54,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:19:54,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:19:49" (1/3) ... [2022-07-23 00:19:54,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e83b6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:19:54, skipping insertion in model container [2022-07-23 00:19:54,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:19:50" (2/3) ... [2022-07-23 00:19:54,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e83b6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:19:54, skipping insertion in model container [2022-07-23 00:19:54,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:19:54" (3/3) ... [2022-07-23 00:19:54,814 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-23 00:19:54,825 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:19:54,826 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:19:54,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:19:54,892 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@4ff5b908, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@607e6c36 [2022-07-23 00:19:54,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:19:54,899 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-23 00:19:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 00:19:54,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:54,919 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-23 00:19:54,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:54,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash -422849068, now seen corresponding path program 1 times [2022-07-23 00:19:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:19:54,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095275050] [2022-07-23 00:19:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:54,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:19:54,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:19:54,936 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-23 00:19:54,937 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-23 00:19:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:55,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 00:19:55,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:55,199 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-23 00:19:55,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:55,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:19:55,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095275050] [2022-07-23 00:19:55,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095275050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:55,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:55,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 00:19:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812182730] [2022-07-23 00:19:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:55,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:19:55,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:19:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:19:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 00:19:55,252 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-23 00:19:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:55,347 INFO L93 Difference]: Finished difference Result 758 states and 1077 transitions. [2022-07-23 00:19:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:19:55,350 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-23 00:19:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:55,366 INFO L225 Difference]: With dead ends: 758 [2022-07-23 00:19:55,367 INFO L226 Difference]: Without dead ends: 366 [2022-07-23 00:19:55,372 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-23 00:19:55,375 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-23 00:19:55,376 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-23 00:19:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-23 00:19:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-07-23 00:19:55,421 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-23 00:19:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 490 transitions. [2022-07-23 00:19:55,425 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 490 transitions. Word has length 39 [2022-07-23 00:19:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:55,427 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 490 transitions. [2022-07-23 00:19:55,427 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-23 00:19:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 490 transitions. [2022-07-23 00:19:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 00:19:55,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:55,430 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-23 00:19:55,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 00:19:55,632 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-23 00:19:55,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1341730321, now seen corresponding path program 1 times [2022-07-23 00:19:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:19:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569198550] [2022-07-23 00:19:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:55,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:19:55,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:19:55,635 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-23 00:19:55,637 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-23 00:19:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:55,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:19:55,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:55,917 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-23 00:19:55,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:19:56,047 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-23 00:19:56,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:19:56,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569198550] [2022-07-23 00:19:56,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569198550] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:19:56,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:19:56,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-23 00:19:56,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83106322] [2022-07-23 00:19:56,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:19:56,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:19:56,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:19:56,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:19:56,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:19:56,069 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-23 00:19:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:56,206 INFO L93 Difference]: Finished difference Result 728 states and 977 transitions. [2022-07-23 00:19:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:19:56,210 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-23 00:19:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:56,216 INFO L225 Difference]: With dead ends: 728 [2022-07-23 00:19:56,216 INFO L226 Difference]: Without dead ends: 369 [2022-07-23 00:19:56,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:19:56,222 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:19:56,222 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.1s Time] [2022-07-23 00:19:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-23 00:19:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-07-23 00:19:56,249 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-23 00:19:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 493 transitions. [2022-07-23 00:19:56,252 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 493 transitions. Word has length 39 [2022-07-23 00:19:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:56,253 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 493 transitions. [2022-07-23 00:19:56,253 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-23 00:19:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 493 transitions. [2022-07-23 00:19:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 00:19:56,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:56,256 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-23 00:19:56,267 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-23 00:19:56,465 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-23 00:19:56,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -376881154, now seen corresponding path program 2 times [2022-07-23 00:19:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:19:56,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352441771] [2022-07-23 00:19:56,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 00:19:56,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:19:56,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:19:56,470 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-23 00:19:56,472 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-23 00:19:56,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 00:19:56,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:19:56,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 00:19:56,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:56,650 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-23 00:19:56,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:56,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:19:56,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352441771] [2022-07-23 00:19:56,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352441771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:56,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:56,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 00:19:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167169130] [2022-07-23 00:19:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:56,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:19:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:19:56,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:19:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 00:19:56,652 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-23 00:19:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:56,684 INFO L93 Difference]: Finished difference Result 621 states and 819 transitions. [2022-07-23 00:19:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:19:56,686 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-23 00:19:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:56,687 INFO L225 Difference]: With dead ends: 621 [2022-07-23 00:19:56,687 INFO L226 Difference]: Without dead ends: 263 [2022-07-23 00:19:56,688 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-23 00:19:56,689 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-23 00:19:56,689 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-23 00:19:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-23 00:19:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-23 00:19:56,701 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-23 00:19:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2022-07-23 00:19:56,702 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 42 [2022-07-23 00:19:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:56,703 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2022-07-23 00:19:56,703 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-23 00:19:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2022-07-23 00:19:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 00:19:56,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:56,704 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-23 00:19:56,725 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-23 00:19:56,913 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-23 00:19:56,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:56,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2129106285, now seen corresponding path program 1 times [2022-07-23 00:19:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:19:56,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547736697] [2022-07-23 00:19:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:56,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:19:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:19:56,916 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-23 00:19:56,916 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-23 00:19:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:57,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 00:19:57,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:57,209 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-23 00:19:57,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:57,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:19:57,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547736697] [2022-07-23 00:19:57,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547736697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:57,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:57,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 00:19:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765022382] [2022-07-23 00:19:57,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:57,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:19:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:19:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:19:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 00:19:57,211 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-23 00:19:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:57,344 INFO L93 Difference]: Finished difference Result 626 states and 807 transitions. [2022-07-23 00:19:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:19:57,345 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-23 00:19:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:57,347 INFO L225 Difference]: With dead ends: 626 [2022-07-23 00:19:57,347 INFO L226 Difference]: Without dead ends: 374 [2022-07-23 00:19:57,348 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-23 00:19:57,348 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-23 00:19:57,349 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-23 00:19:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-23 00:19:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2022-07-23 00:19:57,363 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-23 00:19:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 479 transitions. [2022-07-23 00:19:57,365 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 479 transitions. Word has length 61 [2022-07-23 00:19:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:57,365 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 479 transitions. [2022-07-23 00:19:57,366 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-23 00:19:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 479 transitions. [2022-07-23 00:19:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 00:19:57,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:57,367 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-23 00:19:57,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-23 00:19:57,592 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-23 00:19:57,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:57,593 INFO L85 PathProgramCache]: Analyzing trace with hash 685608890, now seen corresponding path program 1 times [2022-07-23 00:19:57,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:19:57,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312113098] [2022-07-23 00:19:57,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:57,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:19:57,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:19:57,596 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-23 00:19:57,598 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-23 00:19:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:57,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:19:57,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:57,974 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-23 00:19:57,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:57,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:19:57,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312113098] [2022-07-23 00:19:57,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312113098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:57,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:57,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:19:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603458068] [2022-07-23 00:19:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:57,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:19:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:57,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:57,976 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-23 00:19:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:58,166 INFO L93 Difference]: Finished difference Result 1095 states and 1427 transitions. [2022-07-23 00:19:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:19:58,167 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-23 00:19:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:58,172 INFO L225 Difference]: With dead ends: 1095 [2022-07-23 00:19:58,172 INFO L226 Difference]: Without dead ends: 744 [2022-07-23 00:19:58,173 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-23 00:19:58,174 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-23 00:19:58,174 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-23 00:19:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-23 00:19:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 721. [2022-07-23 00:19:58,199 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-23 00:19:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 933 transitions. [2022-07-23 00:19:58,202 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 933 transitions. Word has length 59 [2022-07-23 00:19:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:58,202 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 933 transitions. [2022-07-23 00:19:58,203 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-23 00:19:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 933 transitions. [2022-07-23 00:19:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-23 00:19:58,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:58,204 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-23 00:19:58,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-23 00:19:58,415 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-23 00:19:58,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2003167721, now seen corresponding path program 1 times [2022-07-23 00:19:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:19:58,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412618221] [2022-07-23 00:19:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:58,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:19:58,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:19:58,432 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-23 00:19:58,434 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-23 00:19:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:58,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:19:58,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:58,788 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-23 00:19:58,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:58,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:19:58,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412618221] [2022-07-23 00:19:58,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412618221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:58,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:58,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:19:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844186006] [2022-07-23 00:19:58,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:58,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:19:58,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:58,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:58,789 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-23 00:19:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:19:58,868 INFO L93 Difference]: Finished difference Result 1454 states and 1889 transitions. [2022-07-23 00:19:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:19:58,869 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-23 00:19:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:19:58,872 INFO L225 Difference]: With dead ends: 1454 [2022-07-23 00:19:58,872 INFO L226 Difference]: Without dead ends: 753 [2022-07-23 00:19:58,874 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-23 00:19:58,874 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-23 00:19:58,874 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-23 00:19:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-07-23 00:19:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 729. [2022-07-23 00:19:58,929 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-23 00:19:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 935 transitions. [2022-07-23 00:19:58,932 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 935 transitions. Word has length 60 [2022-07-23 00:19:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:19:58,932 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 935 transitions. [2022-07-23 00:19:58,932 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-23 00:19:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 935 transitions. [2022-07-23 00:19:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 00:19:58,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:19:58,934 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-23 00:19:58,967 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-23 00:19:59,135 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-23 00:19:59,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:19:59,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:19:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash -524865236, now seen corresponding path program 1 times [2022-07-23 00:19:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:19:59,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86953933] [2022-07-23 00:19:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:19:59,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:19:59,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:19:59,138 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-23 00:19:59,143 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-23 00:19:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:19:59,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:19:59,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:19:59,743 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-23 00:19:59,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:19:59,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:19:59,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86953933] [2022-07-23 00:19:59,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86953933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:19:59,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:19:59,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:19:59,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115884238] [2022-07-23 00:19:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:19:59,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:19:59,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:19:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:19:59,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:19:59,745 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-23 00:20:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:00,030 INFO L93 Difference]: Finished difference Result 1470 states and 1889 transitions. [2022-07-23 00:20:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:20:00,030 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-23 00:20:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:00,048 INFO L225 Difference]: With dead ends: 1470 [2022-07-23 00:20:00,048 INFO L226 Difference]: Without dead ends: 761 [2022-07-23 00:20:00,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:20:00,054 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 319 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 00:20:00,054 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-23 00:20:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-07-23 00:20:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 737. [2022-07-23 00:20:00,116 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-23 00:20:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 937 transitions. [2022-07-23 00:20:00,120 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 937 transitions. Word has length 62 [2022-07-23 00:20:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:00,121 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 937 transitions. [2022-07-23 00:20:00,121 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-23 00:20:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 937 transitions. [2022-07-23 00:20:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 00:20:00,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:00,123 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-23 00:20:00,145 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-23 00:20:00,336 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-23 00:20:00,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1732611677, now seen corresponding path program 1 times [2022-07-23 00:20:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:00,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482530068] [2022-07-23 00:20:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:00,340 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-23 00:20:00,356 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-23 00:20:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:00,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:20:00,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:00,948 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-23 00:20:00,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:20:00,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:00,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482530068] [2022-07-23 00:20:00,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482530068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:20:00,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:20:00,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:20:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065312596] [2022-07-23 00:20:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:20:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:20:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:20:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:20:00,950 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-23 00:20:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:01,243 INFO L93 Difference]: Finished difference Result 1403 states and 1785 transitions. [2022-07-23 00:20:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:20:01,244 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-23 00:20:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:01,248 INFO L225 Difference]: With dead ends: 1403 [2022-07-23 00:20:01,248 INFO L226 Difference]: Without dead ends: 686 [2022-07-23 00:20:01,251 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-23 00:20:01,252 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:20:01,252 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.1s Time] [2022-07-23 00:20:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-07-23 00:20:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 668. [2022-07-23 00:20:01,308 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-23 00:20:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 839 transitions. [2022-07-23 00:20:01,313 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 839 transitions. Word has length 61 [2022-07-23 00:20:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:01,313 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 839 transitions. [2022-07-23 00:20:01,313 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-23 00:20:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 839 transitions. [2022-07-23 00:20:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 00:20:01,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:01,322 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-23 00:20:01,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-23 00:20:01,537 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-23 00:20:01,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:01,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1941224850, now seen corresponding path program 1 times [2022-07-23 00:20:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:01,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386184406] [2022-07-23 00:20:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:01,544 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-23 00:20:01,559 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-23 00:20:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:02,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 00:20:02,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:02,596 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-23 00:20:02,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:20:03,233 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-23 00:20:03,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:03,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386184406] [2022-07-23 00:20:03,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386184406] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-23 00:20:03,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:20:03,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2022-07-23 00:20:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060488085] [2022-07-23 00:20:03,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:20:03,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 00:20:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:03,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 00:20:03,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-23 00:20:03,236 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-23 00:20:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:05,439 INFO L93 Difference]: Finished difference Result 1622 states and 2039 transitions. [2022-07-23 00:20:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 00:20:05,441 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-23 00:20:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:05,445 INFO L225 Difference]: With dead ends: 1622 [2022-07-23 00:20:05,445 INFO L226 Difference]: Without dead ends: 981 [2022-07-23 00:20:05,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-23 00:20:05,450 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 341 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:20:05,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1996 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-23 00:20:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-23 00:20:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 918. [2022-07-23 00:20:05,505 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-23 00:20:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1160 transitions. [2022-07-23 00:20:05,509 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1160 transitions. Word has length 71 [2022-07-23 00:20:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:05,510 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1160 transitions. [2022-07-23 00:20:05,510 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-23 00:20:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1160 transitions. [2022-07-23 00:20:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-23 00:20:05,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:05,514 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-23 00:20:05,541 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-23 00:20:05,727 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-23 00:20:05,727 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash 644086264, now seen corresponding path program 1 times [2022-07-23 00:20:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412262530] [2022-07-23 00:20:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:05,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:05,732 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-23 00:20:05,769 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-23 00:20:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:06,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 00:20:06,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:06,501 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-23 00:20:06,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:20:06,933 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-23 00:20:06,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:06,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412262530] [2022-07-23 00:20:06,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412262530] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:20:06,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:20:06,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-23 00:20:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623611781] [2022-07-23 00:20:06,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:20:06,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 00:20:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 00:20:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:20:06,935 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-23 00:20:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:09,508 INFO L93 Difference]: Finished difference Result 2134 states and 2693 transitions. [2022-07-23 00:20:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 00:20:09,509 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-23 00:20:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:09,514 INFO L225 Difference]: With dead ends: 2134 [2022-07-23 00:20:09,514 INFO L226 Difference]: Without dead ends: 1243 [2022-07-23 00:20:09,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-23 00:20:09,516 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 722 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 00:20:09,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2738 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-23 00:20:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-07-23 00:20:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1178. [2022-07-23 00:20:09,545 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-23 00:20:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-23 00:20:09,550 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 72 [2022-07-23 00:20:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:09,550 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-23 00:20:09,551 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-23 00:20:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-23 00:20:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-23 00:20:09,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:09,553 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-23 00:20:09,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-23 00:20:09,764 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-23 00:20:09,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1082506311, now seen corresponding path program 1 times [2022-07-23 00:20:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:09,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807692519] [2022-07-23 00:20:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:09,767 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-23 00:20:09,769 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-23 00:20:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:10,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 00:20:10,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:10,400 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-23 00:20:10,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:20:10,804 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-23 00:20:10,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:10,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807692519] [2022-07-23 00:20:10,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807692519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:20:10,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:20:10,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-23 00:20:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509240391] [2022-07-23 00:20:10,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:20:10,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 00:20:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 00:20:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:20:10,806 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-23 00:20:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:12,870 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-23 00:20:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 00:20:12,871 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-23 00:20:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:12,877 INFO L225 Difference]: With dead ends: 2654 [2022-07-23 00:20:12,877 INFO L226 Difference]: Without dead ends: 1503 [2022-07-23 00:20:12,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-23 00:20:12,901 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 764 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:20:12,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 2510 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-23 00:20:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-23 00:20:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-23 00:20:12,934 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-23 00:20:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-23 00:20:12,941 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 73 [2022-07-23 00:20:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:12,942 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-23 00:20:12,942 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-23 00:20:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-23 00:20:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 00:20:12,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:12,944 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-23 00:20:12,972 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-23 00:20:13,156 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-23 00:20:13,156 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash -608187279, now seen corresponding path program 1 times [2022-07-23 00:20:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:13,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957482135] [2022-07-23 00:20:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:13,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:13,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:13,160 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-23 00:20:13,161 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-23 00:20:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:13,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 00:20:13,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:13,634 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-23 00:20:13,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:20:13,916 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-23 00:20:13,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:13,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957482135] [2022-07-23 00:20:13,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957482135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:20:13,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:20:13,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-23 00:20:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550391687] [2022-07-23 00:20:13,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:20:13,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 00:20:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 00:20:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:20:13,917 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-23 00:20:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:15,365 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-23 00:20:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 00:20:15,366 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-23 00:20:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:15,375 INFO L225 Difference]: With dead ends: 2654 [2022-07-23 00:20:15,375 INFO L226 Difference]: Without dead ends: 1503 [2022-07-23 00:20:15,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-23 00:20:15,379 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 774 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:20:15,379 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.0s Time] [2022-07-23 00:20:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-23 00:20:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-23 00:20:15,408 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-23 00:20:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-23 00:20:15,411 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 74 [2022-07-23 00:20:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:15,412 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-23 00:20:15,412 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-23 00:20:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-23 00:20:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-23 00:20:15,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:15,422 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-23 00:20:15,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 00:20:15,633 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-23 00:20:15,634 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:15,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2022215437, now seen corresponding path program 1 times [2022-07-23 00:20:15,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:15,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622287159] [2022-07-23 00:20:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:15,636 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-23 00:20:15,638 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-23 00:20:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:15,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 00:20:15,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:15,970 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-23 00:20:15,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:20:15,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:15,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622287159] [2022-07-23 00:20:15,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622287159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:20:15,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:20:15,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 00:20:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175421471] [2022-07-23 00:20:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:20:15,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:20:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:20:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 00:20:15,972 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-23 00:20:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:16,114 INFO L93 Difference]: Finished difference Result 2624 states and 3365 transitions. [2022-07-23 00:20:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:20:16,115 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-23 00:20:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:16,120 INFO L225 Difference]: With dead ends: 2624 [2022-07-23 00:20:16,123 INFO L226 Difference]: Without dead ends: 1473 [2022-07-23 00:20:16,126 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-23 00:20:16,128 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-23 00:20:16,129 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-23 00:20:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-07-23 00:20:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1470. [2022-07-23 00:20:16,165 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-23 00:20:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1866 transitions. [2022-07-23 00:20:16,168 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1866 transitions. Word has length 79 [2022-07-23 00:20:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:16,169 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 1866 transitions. [2022-07-23 00:20:16,169 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-23 00:20:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1866 transitions. [2022-07-23 00:20:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-23 00:20:16,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:16,171 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-23 00:20:16,192 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-23 00:20:16,382 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-23 00:20:16,383 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1967013804, now seen corresponding path program 1 times [2022-07-23 00:20:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:16,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319313288] [2022-07-23 00:20:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:16,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:16,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:16,385 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-23 00:20:16,386 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-23 00:20:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:16,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 00:20:16,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:16,992 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-23 00:20:16,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:20:17,638 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-23 00:20:17,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:17,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319313288] [2022-07-23 00:20:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319313288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:20:17,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:20:17,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-07-23 00:20:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892597993] [2022-07-23 00:20:17,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:20:17,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 00:20:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 00:20:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-23 00:20:17,640 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-23 00:20:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:19,564 INFO L93 Difference]: Finished difference Result 3170 states and 4014 transitions. [2022-07-23 00:20:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 00:20:19,564 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-23 00:20:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:19,569 INFO L225 Difference]: With dead ends: 3170 [2022-07-23 00:20:19,570 INFO L226 Difference]: Without dead ends: 1727 [2022-07-23 00:20:19,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-07-23 00:20:19,585 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 709 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:20:19,585 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.5s Time] [2022-07-23 00:20:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-07-23 00:20:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 412. [2022-07-23 00:20:19,609 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-23 00:20:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 502 transitions. [2022-07-23 00:20:19,610 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 502 transitions. Word has length 84 [2022-07-23 00:20:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:19,610 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 502 transitions. [2022-07-23 00:20:19,610 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-23 00:20:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 502 transitions. [2022-07-23 00:20:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-23 00:20:19,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:19,612 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-23 00:20:19,656 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-23 00:20:19,820 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-23 00:20:19,821 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:19,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash -446383630, now seen corresponding path program 1 times [2022-07-23 00:20:19,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:19,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361413728] [2022-07-23 00:20:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:19,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:19,823 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-23 00:20:19,825 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-23 00:20:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:20:20,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 00:20:20,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:20:20,084 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-23 00:20:20,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:20:20,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 00:20:20,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361413728] [2022-07-23 00:20:20,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361413728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:20:20,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:20:20,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 00:20:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030592850] [2022-07-23 00:20:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:20:20,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:20:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 00:20:20,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:20:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 00:20:20,087 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-23 00:20:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:20:20,191 INFO L93 Difference]: Finished difference Result 1001 states and 1214 transitions. [2022-07-23 00:20:20,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:20:20,192 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-23 00:20:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:20:20,201 INFO L225 Difference]: With dead ends: 1001 [2022-07-23 00:20:20,202 INFO L226 Difference]: Without dead ends: 616 [2022-07-23 00:20:20,214 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-23 00:20:20,214 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-23 00:20:20,214 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-23 00:20:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-07-23 00:20:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2022-07-23 00:20:20,244 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-23 00:20:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 731 transitions. [2022-07-23 00:20:20,247 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 731 transitions. Word has length 92 [2022-07-23 00:20:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:20:20,248 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 731 transitions. [2022-07-23 00:20:20,248 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-23 00:20:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 731 transitions. [2022-07-23 00:20:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-23 00:20:20,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:20:20,254 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-23 00:20:20,275 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-23 00:20:20,474 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-23 00:20:20,474 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:20:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:20:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1210197595, now seen corresponding path program 1 times [2022-07-23 00:20:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 00:20:20,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480400114] [2022-07-23 00:20:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:20:20,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 00:20:20,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 00:20:20,476 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-23 00:20:20,478 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-23 00:20:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 00:20:20,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 00:20:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 00:20:21,369 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-23 00:20:21,369 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 00:20:21,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-23 00:20:21,393 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-23 00:20:21,584 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-23 00:20:21,587 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:20:21,590 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 00:20:21,610 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,624 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,625 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,631 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,632 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,637 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,642 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,643 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,644 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,645 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,646 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,647 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,647 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,647 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,647 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,647 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,647 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,648 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,648 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,648 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,648 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,648 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,648 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,648 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,649 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,649 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,649 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,649 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,649 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,649 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,650 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,650 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,650 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,650 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,650 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,650 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,651 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,651 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,651 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,651 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,651 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,651 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,651 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,652 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,652 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,652 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,652 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,652 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,653 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,653 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,653 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,653 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,654 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,655 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,656 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,656 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,656 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,656 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,656 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,656 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,656 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,657 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,657 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,657 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,657 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,657 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,657 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,657 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,658 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,658 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-23 00:20:21,658 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-23 00:20:21,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 12:20:21 BoogieIcfgContainer [2022-07-23 00:20:21,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 00:20:21,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 00:20:21,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 00:20:21,749 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 00:20:21,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:19:54" (3/4) ... [2022-07-23 00:20:21,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 00:20:21,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 00:20:21,753 INFO L158 Benchmark]: Toolchain (without parser) took 32039.82ms. Allocated memory was 56.6MB in the beginning and 188.7MB in the end (delta: 132.1MB). Free memory was 36.9MB in the beginning and 100.8MB in the end (delta: -63.9MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-07-23 00:20:21,753 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 35.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 00:20:21,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1147.81ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 36.7MB in the beginning and 42.6MB in the end (delta: -5.8MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2022-07-23 00:20:21,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.04ms. Allocated memory is still 77.6MB. Free memory was 42.6MB in the beginning and 37.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 00:20:21,754 INFO L158 Benchmark]: Boogie Preprocessor took 119.24ms. Allocated memory is still 77.6MB. Free memory was 37.2MB in the beginning and 43.7MB in the end (delta: -6.5MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-07-23 00:20:21,754 INFO L158 Benchmark]: RCFGBuilder took 3696.41ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 43.7MB in the beginning and 60.3MB in the end (delta: -16.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-07-23 00:20:21,755 INFO L158 Benchmark]: TraceAbstraction took 26940.47ms. Allocated memory was 121.6MB in the beginning and 188.7MB in the end (delta: 67.1MB). Free memory was 59.4MB in the beginning and 101.8MB in the end (delta: -42.4MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2022-07-23 00:20:21,755 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 188.7MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 00:20:21,762 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.09ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 35.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1147.81ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 36.7MB in the beginning and 42.6MB in the end (delta: -5.8MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.04ms. Allocated memory is still 77.6MB. Free memory was 42.6MB in the beginning and 37.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.24ms. Allocated memory is still 77.6MB. Free memory was 37.2MB in the beginning and 43.7MB in the end (delta: -6.5MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3696.41ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 43.7MB in the beginning and 60.3MB in the end (delta: -16.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26940.47ms. Allocated memory was 121.6MB in the beginning and 188.7MB in the end (delta: 67.1MB). Free memory was 59.4MB in the beginning and 101.8MB in the end (delta: -42.4MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 188.7MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#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={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: 26.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5496 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5457 mSDsluCounter, 21173 SdHoareTripleChecker+Invalid, 7.2s 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, 4.3s 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.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 5.8s 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-23 00:20:21,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample