./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro --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 b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:34:03,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:34:03,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:34:03,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:34:03,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:34:03,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:34:03,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:34:03,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:34:03,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:34:03,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:34:03,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:34:03,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:34:03,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:34:03,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:34:03,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:34:03,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:34:03,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:34:03,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:34:03,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:34:03,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:34:03,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:34:03,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:34:03,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:34:03,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:34:03,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:34:03,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:34:03,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:34:03,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:34:03,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:34:03,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:34:03,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:34:03,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:34:03,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:34:03,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:34:03,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:34:03,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:34:03,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:34:03,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:34:03,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:34:03,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:34:03,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:34:03,630 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:34:03,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:34:03,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:34:03,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:34:03,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:34:03,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:34:03,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:34:03,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:34:03,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:34:03,679 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:34:03,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:34:03,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:34:03,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:34:03,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:34:03,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:34:03,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:34:03,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:34:03,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:34:03,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:34:03,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:34:03,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:34:03,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:34:03,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:03,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:34:03,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:34:03,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:34:03,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:34:03,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:34:03,686 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:34:03,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:34:03,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:34:03,687 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro 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 -> b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a [2022-11-18 20:34:03,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:34:04,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:34:04,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:34:04,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:34:04,055 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:34:04,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-18 20:34:04,174 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/aaa6d5218/3c0edfe5912d4748b120f1079c1ea924/FLAG62bbb4306 [2022-11-18 20:34:05,241 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:34:05,242 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-18 20:34:05,285 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/aaa6d5218/3c0edfe5912d4748b120f1079c1ea924/FLAG62bbb4306 [2022-11-18 20:34:05,539 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/aaa6d5218/3c0edfe5912d4748b120f1079c1ea924 [2022-11-18 20:34:05,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:34:05,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:34:05,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:05,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:34:05,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:34:05,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:05" (1/1) ... [2022-11-18 20:34:05,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:05, skipping insertion in model container [2022-11-18 20:34:05,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:05" (1/1) ... [2022-11-18 20:34:05,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:34:05,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:34:07,574 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-11-18 20:34:07,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:07,641 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:34:08,110 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-11-18 20:34:08,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:08,316 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:34:08,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08 WrapperNode [2022-11-18 20:34:08,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:08,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:08,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:34:08,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:34:08,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,550 INFO L138 Inliner]: procedures = 187, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3211 [2022-11-18 20:34:08,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:08,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:34:08,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:34:08,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:34:08,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,728 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:34:08,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:34:08,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:34:08,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:34:08,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (1/1) ... [2022-11-18 20:34:08,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:08,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:08,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:34:08,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:34:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-11-18 20:34:08,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-11-18 20:34:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-11-18 20:34:08,897 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-11-18 20:34:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-18 20:34:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-11-18 20:34:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-11-18 20:34:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-11-18 20:34:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-18 20:34:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-18 20:34:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:34:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:34:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:34:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-18 20:34:08,899 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-18 20:34:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-18 20:34:08,899 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-18 20:34:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-11-18 20:34:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-11-18 20:34:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-11-18 20:34:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-11-18 20:34:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-18 20:34:08,901 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-18 20:34:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-11-18 20:34:08,901 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-11-18 20:34:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:34:08,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:34:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-18 20:34:08,902 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-18 20:34:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-11-18 20:34:08,902 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-11-18 20:34:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 20:34:08,902 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 20:34:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-11-18 20:34:08,903 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-11-18 20:34:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:34:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 20:34:08,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 20:34:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-18 20:34:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-18 20:34:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-18 20:34:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-18 20:34:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:34:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:34:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-18 20:34:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-18 20:34:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-18 20:34:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-18 20:34:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:34:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-11-18 20:34:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-11-18 20:34:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-18 20:34:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-18 20:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-11-18 20:34:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-11-18 20:34:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-11-18 20:34:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-11-18 20:34:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:34:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-18 20:34:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-18 20:34:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-11-18 20:34:08,912 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-11-18 20:34:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:34:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:34:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-18 20:34:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-18 20:34:08,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-18 20:34:08,913 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-11-18 20:34:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-11-18 20:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-11-18 20:34:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-11-18 20:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-11-18 20:34:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-11-18 20:34:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:34:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-18 20:34:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-18 20:34:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-11-18 20:34:08,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-11-18 20:34:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-18 20:34:08,917 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-18 20:34:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-11-18 20:34:08,917 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-11-18 20:34:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-11-18 20:34:08,917 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-11-18 20:34:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:34:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-11-18 20:34:08,918 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-11-18 20:34:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:34:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-11-18 20:34:08,918 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-11-18 20:34:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-18 20:34:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-18 20:34:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-11-18 20:34:08,920 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-11-18 20:34:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-18 20:34:08,920 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-18 20:34:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-11-18 20:34:08,922 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-11-18 20:34:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-11-18 20:34:08,923 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-11-18 20:34:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-18 20:34:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-18 20:34:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-18 20:34:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-18 20:34:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-18 20:34:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-18 20:34:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-18 20:34:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-18 20:34:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-11-18 20:34:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-11-18 20:34:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:34:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-18 20:34:08,926 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-18 20:34:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-11-18 20:34:08,927 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-11-18 20:34:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-18 20:34:08,927 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-18 20:34:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-18 20:34:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:34:08,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:34:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-11-18 20:34:08,933 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-11-18 20:34:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-18 20:34:08,934 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-18 20:34:09,840 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:34:09,844 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:34:10,187 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:34:14,099 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:34:14,130 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:34:14,131 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:34:14,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:14 BoogieIcfgContainer [2022-11-18 20:34:14,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:34:14,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:34:14,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:34:14,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:34:14,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:05" (1/3) ... [2022-11-18 20:34:14,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a68d13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:14, skipping insertion in model container [2022-11-18 20:34:14,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:08" (2/3) ... [2022-11-18 20:34:14,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a68d13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:14, skipping insertion in model container [2022-11-18 20:34:14,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:14" (3/3) ... [2022-11-18 20:34:14,148 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-18 20:34:14,173 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:34:14,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:34:14,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:34:14,289 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@698c4b5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:34:14,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:34:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 1105 states, 815 states have (on average 1.4233128834355828) internal successors, (1160), 847 states have internal predecessors, (1160), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2022-11-18 20:34:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-18 20:34:14,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:14,373 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:14,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash 44265056, now seen corresponding path program 1 times [2022-11-18 20:34:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:14,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177995450] [2022-11-18 20:34:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:14,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:34:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:34:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:34:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:34:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:34:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:34:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:34:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:34:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:34:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:34:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:34:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:34:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-11-18 20:34:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:15,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177995450] [2022-11-18 20:34:15,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177995450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:15,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:15,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:34:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902819537] [2022-11-18 20:34:15,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:15,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:34:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:15,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:34:15,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:34:15,752 INFO L87 Difference]: Start difference. First operand has 1105 states, 815 states have (on average 1.4233128834355828) internal successors, (1160), 847 states have internal predecessors, (1160), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:34:21,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:34:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:24,759 INFO L93 Difference]: Finished difference Result 2336 states and 3503 transitions. [2022-11-18 20:34:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2022-11-18 20:34:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:24,813 INFO L225 Difference]: With dead ends: 2336 [2022-11-18 20:34:24,814 INFO L226 Difference]: Without dead ends: 1193 [2022-11-18 20:34:24,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:24,845 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 1117 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 619 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:24,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 3142 Invalid, 2793 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [619 Valid, 2173 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-11-18 20:34:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2022-11-18 20:34:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1063. [2022-11-18 20:34:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 786 states have (on average 1.4147582697201018) internal successors, (1112), 810 states have internal predecessors, (1112), 224 states have call successors, (224), 52 states have call predecessors, (224), 52 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-11-18 20:34:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1560 transitions. [2022-11-18 20:34:25,146 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1560 transitions. Word has length 161 [2022-11-18 20:34:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:25,146 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1560 transitions. [2022-11-18 20:34:25,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:34:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1560 transitions. [2022-11-18 20:34:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-18 20:34:25,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:25,161 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:25,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:34:25,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1574532458, now seen corresponding path program 1 times [2022-11-18 20:34:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:25,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661627513] [2022-11-18 20:34:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:34:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:34:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:34:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:34:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:34:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:34:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:34:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:34:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:34:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:34:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:34:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:34:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-11-18 20:34:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:25,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661627513] [2022-11-18 20:34:25,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661627513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:25,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:25,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:34:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434351674] [2022-11-18 20:34:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:25,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:34:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:34:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:25,909 INFO L87 Difference]: Start difference. First operand 1063 states and 1560 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-18 20:34:32,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:34:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:35,850 INFO L93 Difference]: Finished difference Result 2879 states and 4247 transitions. [2022-11-18 20:34:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:34:35,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 161 [2022-11-18 20:34:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:35,870 INFO L225 Difference]: With dead ends: 2879 [2022-11-18 20:34:35,870 INFO L226 Difference]: Without dead ends: 1852 [2022-11-18 20:34:35,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:34:35,877 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 3949 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 2071 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4088 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 4493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2071 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:35,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4088 Valid, 2801 Invalid, 4493 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2071 Valid, 2421 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2022-11-18 20:34:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-11-18 20:34:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1620. [2022-11-18 20:34:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1187 states have (on average 1.3976411120471777) internal successors, (1659), 1220 states have internal predecessors, (1659), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-11-18 20:34:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2341 transitions. [2022-11-18 20:34:36,003 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2341 transitions. Word has length 161 [2022-11-18 20:34:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:36,004 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2341 transitions. [2022-11-18 20:34:36,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-18 20:34:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2341 transitions. [2022-11-18 20:34:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-18 20:34:36,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:36,014 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:34:36,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:34:36,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1388732210, now seen corresponding path program 1 times [2022-11-18 20:34:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:36,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074708920] [2022-11-18 20:34:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:34:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:34:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:34:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:34:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:34:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:34:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:34:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:34:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:34:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:34:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:34:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:34:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:34:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-18 20:34:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-18 20:34:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-11-18 20:34:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:36,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074708920] [2022-11-18 20:34:36,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074708920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:36,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:36,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:34:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671591228] [2022-11-18 20:34:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:36,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:34:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:36,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:34:36,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:36,802 INFO L87 Difference]: Start difference. First operand 1620 states and 2341 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-18 20:34:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:42,189 INFO L93 Difference]: Finished difference Result 3426 states and 5017 transitions. [2022-11-18 20:34:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:34:42,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 222 [2022-11-18 20:34:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:42,205 INFO L225 Difference]: With dead ends: 3426 [2022-11-18 20:34:42,205 INFO L226 Difference]: Without dead ends: 1852 [2022-11-18 20:34:42,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:34:42,214 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 3366 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 1480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3507 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1480 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3507 Valid, 1956 Invalid, 2805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1480 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-18 20:34:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-11-18 20:34:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1620. [2022-11-18 20:34:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1187 states have (on average 1.395956192080876) internal successors, (1657), 1220 states have internal predecessors, (1657), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-11-18 20:34:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2339 transitions. [2022-11-18 20:34:42,336 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2339 transitions. Word has length 222 [2022-11-18 20:34:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:42,337 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2339 transitions. [2022-11-18 20:34:42,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-18 20:34:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2339 transitions. [2022-11-18 20:34:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-18 20:34:42,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:42,346 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:34:42,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:34:42,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 519725580, now seen corresponding path program 1 times [2022-11-18 20:34:42,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:42,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095122817] [2022-11-18 20:34:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:34:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:34:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:34:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:34:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:34:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:34:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:34:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:34:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:34:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:34:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:34:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:34:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:34:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-18 20:34:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-18 20:34:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-11-18 20:34:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:43,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095122817] [2022-11-18 20:34:43,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095122817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:43,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:43,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:34:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242729137] [2022-11-18 20:34:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:43,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:34:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:43,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:34:43,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:34:43,164 INFO L87 Difference]: Start difference. First operand 1620 states and 2339 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-18 20:34:46,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:34:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:50,840 INFO L93 Difference]: Finished difference Result 3430 states and 5017 transitions. [2022-11-18 20:34:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:34:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 222 [2022-11-18 20:34:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:50,854 INFO L225 Difference]: With dead ends: 3430 [2022-11-18 20:34:50,855 INFO L226 Difference]: Without dead ends: 1852 [2022-11-18 20:34:50,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:34:50,862 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1226 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 3417 mSolverCounterSat, 620 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 4038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 3417 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:50,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 4135 Invalid, 4038 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [620 Valid, 3417 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-11-18 20:34:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-11-18 20:34:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1620. [2022-11-18 20:34:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1187 states have (on average 1.3942712721145745) internal successors, (1655), 1220 states have internal predecessors, (1655), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-11-18 20:34:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2337 transitions. [2022-11-18 20:34:50,976 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2337 transitions. Word has length 222 [2022-11-18 20:34:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:50,977 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2337 transitions. [2022-11-18 20:34:50,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-18 20:34:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2337 transitions. [2022-11-18 20:34:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-18 20:34:50,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:50,987 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:34:50,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:34:50,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 64554228, now seen corresponding path program 1 times [2022-11-18 20:34:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:50,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480018826] [2022-11-18 20:34:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:34:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:34:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:34:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:34:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:34:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:34:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:34:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:34:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:34:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:34:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:34:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:34:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:34:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:34:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:34:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:34:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-11-18 20:34:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:51,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480018826] [2022-11-18 20:34:51,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480018826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:51,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:51,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:34:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579886152] [2022-11-18 20:34:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:51,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:34:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:34:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:34:51,861 INFO L87 Difference]: Start difference. First operand 1620 states and 2337 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-18 20:34:55,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:01,281 INFO L93 Difference]: Finished difference Result 2442 states and 3726 transitions. [2022-11-18 20:35:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:35:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 225 [2022-11-18 20:35:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:01,301 INFO L225 Difference]: With dead ends: 2442 [2022-11-18 20:35:01,302 INFO L226 Difference]: Without dead ends: 2440 [2022-11-18 20:35:01,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:35:01,305 INFO L413 NwaCegarLoop]: 1558 mSDtfsCounter, 2431 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 3375 mSolverCounterSat, 1137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2521 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 4512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1137 IncrementalHoareTripleChecker+Valid, 3375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:01,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2521 Valid, 5376 Invalid, 4512 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1137 Valid, 3375 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-11-18 20:35:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2022-11-18 20:35:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 1622. [2022-11-18 20:35:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1189 states have (on average 1.3936080740117747) internal successors, (1657), 1222 states have internal predecessors, (1657), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-11-18 20:35:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2339 transitions. [2022-11-18 20:35:01,466 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2339 transitions. Word has length 225 [2022-11-18 20:35:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:01,467 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 2339 transitions. [2022-11-18 20:35:01,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-18 20:35:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2339 transitions. [2022-11-18 20:35:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-18 20:35:01,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:01,478 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:35:01,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:35:01,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash -780632200, now seen corresponding path program 1 times [2022-11-18 20:35:01,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:01,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756276987] [2022-11-18 20:35:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:35:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:35:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:35:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:35:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:35:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:35:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:35:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:35:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:35:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:35:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:35:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:35:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:35:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:35:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:35:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:35:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-18 20:35:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-11-18 20:35:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:02,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756276987] [2022-11-18 20:35:02,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756276987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:02,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:02,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:35:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593248664] [2022-11-18 20:35:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:35:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:35:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:35:02,480 INFO L87 Difference]: Start difference. First operand 1622 states and 2339 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-18 20:35:04,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:06,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:13,500 INFO L93 Difference]: Finished difference Result 4020 states and 6007 transitions. [2022-11-18 20:35:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:35:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 235 [2022-11-18 20:35:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:13,518 INFO L225 Difference]: With dead ends: 4020 [2022-11-18 20:35:13,518 INFO L226 Difference]: Without dead ends: 2444 [2022-11-18 20:35:13,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:35:13,526 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 3040 mSDsluCounter, 3481 mSDsCounter, 0 mSdLazyCounter, 3917 mSolverCounterSat, 1138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3311 SdHoareTripleChecker+Valid, 4737 SdHoareTripleChecker+Invalid, 5055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1138 IncrementalHoareTripleChecker+Valid, 3917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:13,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3311 Valid, 4737 Invalid, 5055 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1138 Valid, 3917 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-11-18 20:35:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2022-11-18 20:35:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 1623. [2022-11-18 20:35:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1190 states have (on average 1.3932773109243697) internal successors, (1658), 1223 states have internal predecessors, (1658), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-11-18 20:35:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2340 transitions. [2022-11-18 20:35:13,675 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2340 transitions. Word has length 235 [2022-11-18 20:35:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:13,676 INFO L495 AbstractCegarLoop]: Abstraction has 1623 states and 2340 transitions. [2022-11-18 20:35:13,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-18 20:35:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2340 transitions. [2022-11-18 20:35:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-18 20:35:13,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:13,686 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:35:13,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:35:13,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1357205095, now seen corresponding path program 1 times [2022-11-18 20:35:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:13,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511811937] [2022-11-18 20:35:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:35:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:35:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:35:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:35:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:35:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:35:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:35:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:35:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:35:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:35:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:35:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:35:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:35:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:35:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:35:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:35:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-18 20:35:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-11-18 20:35:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511811937] [2022-11-18 20:35:14,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511811937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:14,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:14,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:35:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970613004] [2022-11-18 20:35:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:14,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:35:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:35:14,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:35:14,524 INFO L87 Difference]: Start difference. First operand 1623 states and 2340 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-18 20:35:17,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:24,165 INFO L93 Difference]: Finished difference Result 3375 states and 5307 transitions. [2022-11-18 20:35:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:35:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 237 [2022-11-18 20:35:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:24,194 INFO L225 Difference]: With dead ends: 3375 [2022-11-18 20:35:24,194 INFO L226 Difference]: Without dead ends: 3373 [2022-11-18 20:35:24,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:35:24,198 INFO L413 NwaCegarLoop]: 1981 mSDtfsCounter, 3868 mSDsluCounter, 6107 mSDsCounter, 0 mSdLazyCounter, 4681 mSolverCounterSat, 1768 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4057 SdHoareTripleChecker+Valid, 8088 SdHoareTripleChecker+Invalid, 6450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1768 IncrementalHoareTripleChecker+Valid, 4681 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:24,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4057 Valid, 8088 Invalid, 6450 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1768 Valid, 4681 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2022-11-18 20:35:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2022-11-18 20:35:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 1625. [2022-11-18 20:35:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1191 states have (on average 1.3929471032745593) internal successors, (1659), 1223 states have internal predecessors, (1659), 342 states have call successors, (342), 91 states have call predecessors, (342), 91 states have return successors, (342), 339 states have call predecessors, (342), 342 states have call successors, (342) [2022-11-18 20:35:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2343 transitions. [2022-11-18 20:35:24,459 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2343 transitions. Word has length 237 [2022-11-18 20:35:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:24,460 INFO L495 AbstractCegarLoop]: Abstraction has 1625 states and 2343 transitions. [2022-11-18 20:35:24,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-18 20:35:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2343 transitions. [2022-11-18 20:35:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-11-18 20:35:24,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:24,475 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:35:24,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:35:24,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1932112850, now seen corresponding path program 1 times [2022-11-18 20:35:24,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:24,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968115138] [2022-11-18 20:35:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:35:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:35:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:35:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:35:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:35:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:35:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:35:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:35:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:35:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:35:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:35:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:35:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:35:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:35:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:35:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:35:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-18 20:35:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-18 20:35:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-18 20:35:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-18 20:35:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-18 20:35:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-11-18 20:35:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:25,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968115138] [2022-11-18 20:35:25,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968115138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:25,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:25,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:35:25,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941720467] [2022-11-18 20:35:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:25,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:35:25,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:25,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:35:25,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:35:25,151 INFO L87 Difference]: Start difference. First operand 1625 states and 2343 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-18 20:35:30,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:38,110 INFO L93 Difference]: Finished difference Result 4077 states and 5948 transitions. [2022-11-18 20:35:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:35:38,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 267 [2022-11-18 20:35:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:38,128 INFO L225 Difference]: With dead ends: 4077 [2022-11-18 20:35:38,128 INFO L226 Difference]: Without dead ends: 2498 [2022-11-18 20:35:38,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:35:38,137 INFO L413 NwaCegarLoop]: 1401 mSDtfsCounter, 2360 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 3199 mSolverCounterSat, 991 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 4191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 3199 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:38,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 3983 Invalid, 4191 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [991 Valid, 3199 Invalid, 1 Unknown, 0 Unchecked, 12.3s Time] [2022-11-18 20:35:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2022-11-18 20:35:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2162. [2022-11-18 20:35:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 1577 states have (on average 1.3861762840837033) internal successors, (2186), 1618 states have internal predecessors, (2186), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-11-18 20:35:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3098 transitions. [2022-11-18 20:35:38,504 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 3098 transitions. Word has length 267 [2022-11-18 20:35:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:38,505 INFO L495 AbstractCegarLoop]: Abstraction has 2162 states and 3098 transitions. [2022-11-18 20:35:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-18 20:35:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 3098 transitions. [2022-11-18 20:35:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-18 20:35:38,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:38,524 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:35:38,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:35:38,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1901830632, now seen corresponding path program 1 times [2022-11-18 20:35:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:38,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062850550] [2022-11-18 20:35:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:38,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:35:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:35:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:35:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:35:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:35:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:35:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:35:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:35:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:35:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:35:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:35:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:35:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:35:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:35:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:35:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:35:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-18 20:35:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-18 20:35:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-18 20:35:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-18 20:35:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-18 20:35:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-11-18 20:35:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:39,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062850550] [2022-11-18 20:35:39,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062850550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:39,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:39,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:35:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381274222] [2022-11-18 20:35:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:39,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:35:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:35:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:35:39,355 INFO L87 Difference]: Start difference. First operand 2162 states and 3098 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-18 20:35:42,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:48,176 INFO L93 Difference]: Finished difference Result 4667 states and 6940 transitions. [2022-11-18 20:35:48,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:35:48,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 269 [2022-11-18 20:35:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:48,198 INFO L225 Difference]: With dead ends: 4667 [2022-11-18 20:35:48,199 INFO L226 Difference]: Without dead ends: 3088 [2022-11-18 20:35:48,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:35:48,206 INFO L413 NwaCegarLoop]: 1485 mSDtfsCounter, 3290 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 3453 mSolverCounterSat, 1304 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3555 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 4758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1304 IncrementalHoareTripleChecker+Valid, 3453 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:48,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3555 Valid, 4741 Invalid, 4758 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1304 Valid, 3453 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-11-18 20:35:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-11-18 20:35:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2166. [2022-11-18 20:35:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1581 states have (on average 1.385831752055661) internal successors, (2191), 1622 states have internal predecessors, (2191), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-11-18 20:35:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3103 transitions. [2022-11-18 20:35:48,513 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3103 transitions. Word has length 269 [2022-11-18 20:35:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:48,514 INFO L495 AbstractCegarLoop]: Abstraction has 2166 states and 3103 transitions. [2022-11-18 20:35:48,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-18 20:35:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3103 transitions. [2022-11-18 20:35:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-11-18 20:35:48,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:48,530 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:35:48,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:35:48,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -514116007, now seen corresponding path program 1 times [2022-11-18 20:35:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:48,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627263905] [2022-11-18 20:35:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:48,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:35:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:35:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:35:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:35:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:35:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:35:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:35:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:35:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:35:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:35:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:35:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:35:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:35:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:35:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:35:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:35:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-18 20:35:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-18 20:35:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-18 20:35:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-18 20:35:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-18 20:35:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-11-18 20:35:49,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:49,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627263905] [2022-11-18 20:35:49,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627263905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:49,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:49,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:35:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225019004] [2022-11-18 20:35:49,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:49,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:35:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:35:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:35:49,077 INFO L87 Difference]: Start difference. First operand 2166 states and 3103 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-18 20:35:52,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:55,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:35:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:59,053 INFO L93 Difference]: Finished difference Result 4623 states and 6745 transitions. [2022-11-18 20:35:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:35:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 272 [2022-11-18 20:35:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:59,075 INFO L225 Difference]: With dead ends: 4623 [2022-11-18 20:35:59,075 INFO L226 Difference]: Without dead ends: 2503 [2022-11-18 20:35:59,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:35:59,085 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1221 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 626 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:59,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 3306 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 2566 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2022-11-18 20:35:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-11-18 20:35:59,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2166. [2022-11-18 20:35:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1581 states have (on average 1.3801391524351676) internal successors, (2182), 1622 states have internal predecessors, (2182), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-11-18 20:35:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3094 transitions. [2022-11-18 20:35:59,406 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3094 transitions. Word has length 272 [2022-11-18 20:35:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:59,407 INFO L495 AbstractCegarLoop]: Abstraction has 2166 states and 3094 transitions. [2022-11-18 20:35:59,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-18 20:35:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3094 transitions. [2022-11-18 20:35:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-18 20:35:59,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:59,424 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:35:59,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:35:59,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -636961524, now seen corresponding path program 1 times [2022-11-18 20:35:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:59,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691553420] [2022-11-18 20:35:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:36:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:36:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:36:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:36:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:36:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:36:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:36:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:36:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:36:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:36:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:36:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:36:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:36:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:36:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-18 20:36:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-18 20:36:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-18 20:36:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-18 20:36:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-18 20:36:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-11-18 20:36:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691553420] [2022-11-18 20:36:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691553420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751466719] [2022-11-18 20:36:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:00,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:00,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:00,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:00,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:36:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 1909 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:36:01,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-11-18 20:36:02,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-11-18 20:36:02,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751466719] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:02,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:36:02,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2022-11-18 20:36:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373676826] [2022-11-18 20:36:02,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:02,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:36:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:36:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:36:02,573 INFO L87 Difference]: Start difference. First operand 2166 states and 3094 transitions. Second operand has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2022-11-18 20:36:06,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:09,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:19,797 INFO L93 Difference]: Finished difference Result 6424 states and 9881 transitions. [2022-11-18 20:36:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:36:19,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 275 [2022-11-18 20:36:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:19,833 INFO L225 Difference]: With dead ends: 6424 [2022-11-18 20:36:19,833 INFO L226 Difference]: Without dead ends: 4841 [2022-11-18 20:36:19,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:36:19,843 INFO L413 NwaCegarLoop]: 1958 mSDtfsCounter, 5817 mSDsluCounter, 7077 mSDsCounter, 0 mSdLazyCounter, 6862 mSolverCounterSat, 2360 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6201 SdHoareTripleChecker+Valid, 9035 SdHoareTripleChecker+Invalid, 9224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2360 IncrementalHoareTripleChecker+Valid, 6862 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:19,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6201 Valid, 9035 Invalid, 9224 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2360 Valid, 6862 Invalid, 2 Unknown, 0 Unchecked, 16.0s Time] [2022-11-18 20:36:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2022-11-18 20:36:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 2173. [2022-11-18 20:36:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1588 states have (on average 1.3797229219143576) internal successors, (2191), 1629 states have internal predecessors, (2191), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-11-18 20:36:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3103 transitions. [2022-11-18 20:36:20,262 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3103 transitions. Word has length 275 [2022-11-18 20:36:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:20,263 INFO L495 AbstractCegarLoop]: Abstraction has 2173 states and 3103 transitions. [2022-11-18 20:36:20,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2022-11-18 20:36:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3103 transitions. [2022-11-18 20:36:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-11-18 20:36:20,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:20,277 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:36:20,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:36:20,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 20:36:20,488 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:20,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1045955892, now seen corresponding path program 1 times [2022-11-18 20:36:20,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:20,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988346581] [2022-11-18 20:36:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:21,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:36:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:36:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:36:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:36:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:36:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:36:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:36:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:36:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:36:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:36:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:36:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:36:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:36:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:36:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-18 20:36:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-18 20:36:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-18 20:36:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-18 20:36:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-11-18 20:36:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-18 20:36:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-11-18 20:36:22,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:22,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988346581] [2022-11-18 20:36:22,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988346581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356856998] [2022-11-18 20:36:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:22,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:22,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:22,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:22,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:36:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:36:23,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-11-18 20:36:23,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:23,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356856998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:23,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:36:23,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-11-18 20:36:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566517129] [2022-11-18 20:36:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:23,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:36:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:23,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:36:23,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:36:23,982 INFO L87 Difference]: Start difference. First operand 2173 states and 3103 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-18 20:36:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:24,388 INFO L93 Difference]: Finished difference Result 4322 states and 6181 transitions. [2022-11-18 20:36:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:36:24,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 284 [2022-11-18 20:36:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:24,402 INFO L225 Difference]: With dead ends: 4322 [2022-11-18 20:36:24,402 INFO L226 Difference]: Without dead ends: 2174 [2022-11-18 20:36:24,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:36:24,412 INFO L413 NwaCegarLoop]: 1552 mSDtfsCounter, 3 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4641 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:24,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4641 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:36:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2022-11-18 20:36:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2174. [2022-11-18 20:36:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 1589 states have (on average 1.3794839521711768) internal successors, (2192), 1630 states have internal predecessors, (2192), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-11-18 20:36:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3104 transitions. [2022-11-18 20:36:24,750 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3104 transitions. Word has length 284 [2022-11-18 20:36:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:24,751 INFO L495 AbstractCegarLoop]: Abstraction has 2174 states and 3104 transitions. [2022-11-18 20:36:24,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-18 20:36:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3104 transitions. [2022-11-18 20:36:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-11-18 20:36:24,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:24,764 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:36:24,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:24,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:36:24,977 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:24,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1177017517, now seen corresponding path program 1 times [2022-11-18 20:36:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:24,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559787957] [2022-11-18 20:36:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:36:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:36:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:36:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:36:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:36:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:36:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:36:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:36:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:36:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:36:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:36:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 20:36:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 20:36:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-18 20:36:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-18 20:36:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-18 20:36:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-18 20:36:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-18 20:36:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-11-18 20:36:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-18 20:36:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2022-11-18 20:36:27,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:27,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559787957] [2022-11-18 20:36:27,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559787957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:27,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133862327] [2022-11-18 20:36:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:27,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:27,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:27,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:27,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:36:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:28,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 2076 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:36:28,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2022-11-18 20:36:28,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2022-11-18 20:36:29,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133862327] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:29,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:29,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 6] total 19 [2022-11-18 20:36:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965327545] [2022-11-18 20:36:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:29,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:36:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:36:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:36:29,234 INFO L87 Difference]: Start difference. First operand 2174 states and 3104 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-18 20:36:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:30,480 INFO L93 Difference]: Finished difference Result 5148 states and 7603 transitions. [2022-11-18 20:36:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:36:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 291 [2022-11-18 20:36:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:30,508 INFO L225 Difference]: With dead ends: 5148 [2022-11-18 20:36:30,509 INFO L226 Difference]: Without dead ends: 3558 [2022-11-18 20:36:30,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:36:30,518 INFO L413 NwaCegarLoop]: 2296 mSDtfsCounter, 1228 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 6386 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:30,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 6386 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:36:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-11-18 20:36:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 2176. [2022-11-18 20:36:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1591 states have (on average 1.379006913890635) internal successors, (2194), 1632 states have internal predecessors, (2194), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-11-18 20:36:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3106 transitions. [2022-11-18 20:36:30,974 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3106 transitions. Word has length 291 [2022-11-18 20:36:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:30,975 INFO L495 AbstractCegarLoop]: Abstraction has 2176 states and 3106 transitions. [2022-11-18 20:36:30,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-18 20:36:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3106 transitions. [2022-11-18 20:36:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-11-18 20:36:30,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:30,988 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:36:31,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:31,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:36:31,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1328527815, now seen corresponding path program 1 times [2022-11-18 20:36:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:31,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921331889] [2022-11-18 20:36:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:36:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:36:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:36:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:36:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:36:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:36:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:36:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:36:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:36:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:36:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:36:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 20:36:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 20:36:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-18 20:36:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-18 20:36:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-18 20:36:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-18 20:36:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-18 20:36:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-18 20:36:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-18 20:36:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-11-18 20:36:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-18 20:36:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2022-11-18 20:36:31,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:31,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921331889] [2022-11-18 20:36:31,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921331889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:31,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:31,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:36:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593167265] [2022-11-18 20:36:31,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:31,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:36:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:31,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:36:31,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:36:31,870 INFO L87 Difference]: Start difference. First operand 2176 states and 3106 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-18 20:36:36,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:38,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:45,692 INFO L93 Difference]: Finished difference Result 4729 states and 7007 transitions. [2022-11-18 20:36:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:36:45,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 300 [2022-11-18 20:36:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:45,707 INFO L225 Difference]: With dead ends: 4729 [2022-11-18 20:36:45,708 INFO L226 Difference]: Without dead ends: 3137 [2022-11-18 20:36:45,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:36:45,715 INFO L413 NwaCegarLoop]: 1285 mSDtfsCounter, 2596 mSDsluCounter, 3825 mSDsCounter, 0 mSdLazyCounter, 4044 mSolverCounterSat, 1310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 5110 SdHoareTripleChecker+Invalid, 5354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1310 IncrementalHoareTripleChecker+Valid, 4044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:45,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2727 Valid, 5110 Invalid, 5354 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1310 Valid, 4044 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-11-18 20:36:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2022-11-18 20:36:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2178. [2022-11-18 20:36:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1593 states have (on average 1.3785310734463276) internal successors, (2196), 1634 states have internal predecessors, (2196), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-11-18 20:36:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3108 transitions. [2022-11-18 20:36:46,166 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 3108 transitions. Word has length 300 [2022-11-18 20:36:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:46,167 INFO L495 AbstractCegarLoop]: Abstraction has 2178 states and 3108 transitions. [2022-11-18 20:36:46,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-18 20:36:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 3108 transitions. [2022-11-18 20:36:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-18 20:36:46,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:46,179 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:36:46,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:36:46,180 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 120650264, now seen corresponding path program 1 times [2022-11-18 20:36:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43697133] [2022-11-18 20:36:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:36:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:36:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:36:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:36:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:36:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:36:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:36:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:36:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:36:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:36:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:36:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 20:36:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 20:36:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-18 20:36:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-18 20:36:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-18 20:36:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-18 20:36:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-18 20:36:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-18 20:36:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-18 20:36:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-18 20:36:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-18 20:36:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-18 20:36:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-11-18 20:36:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:48,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43697133] [2022-11-18 20:36:48,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43697133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:48,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801295130] [2022-11-18 20:36:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:48,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:48,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:48,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:36:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:52,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 2310 conjuncts, 212 conjunts are in the unsatisfiable core [2022-11-18 20:36:52,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:54,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:36:54,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:36:54,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:36:54,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:36:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:54,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:54,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:54,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-11-18 20:36:54,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:54,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:36:54,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:36:54,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:36:55,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 20:36:55,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 20:36:55,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 20:36:55,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-11-18 20:36:55,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-11-18 20:36:55,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2022-11-18 20:36:55,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-18 20:36:55,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-18 20:36:56,053 INFO L321 Elim1Store]: treesize reduction 84, result has 20.8 percent of original size [2022-11-18 20:36:56,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 88 [2022-11-18 20:36:56,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-18 20:36:56,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:36:56,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-18 20:36:56,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-11-18 20:36:56,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-18 20:36:56,514 INFO L321 Elim1Store]: treesize reduction 84, result has 20.8 percent of original size [2022-11-18 20:36:56,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 82 [2022-11-18 20:36:56,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-11-18 20:36:56,903 INFO L321 Elim1Store]: treesize reduction 84, result has 20.8 percent of original size [2022-11-18 20:36:56,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 82 [2022-11-18 20:36:56,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:56,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:36:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:57,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 124 [2022-11-18 20:36:57,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:57,565 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-18 20:36:57,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 33 [2022-11-18 20:36:57,573 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-18 20:36:57,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 20 [2022-11-18 20:36:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 168 proven. 34 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-18 20:36:57,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:57,870 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_2514) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_2513) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_2512) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (< .cse0 1)))) is different from false [2022-11-18 20:36:57,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801295130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:57,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:57,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 33] total 38 [2022-11-18 20:36:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589156221] [2022-11-18 20:36:57,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:57,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 20:36:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 20:36:57,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1360, Unknown=1, NotChecked=74, Total=1560 [2022-11-18 20:36:57,903 INFO L87 Difference]: Start difference. First operand 2178 states and 3108 transitions. Second operand has 38 states, 37 states have (on average 6.486486486486487) internal successors, (240), 27 states have internal predecessors, (240), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) [2022-11-18 20:37:06,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:37:10,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:37:14,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:37:17,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:01,240 INFO L93 Difference]: Finished difference Result 4876 states and 7235 transitions. [2022-11-18 20:38:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-18 20:38:01,241 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 6.486486486486487) internal successors, (240), 27 states have internal predecessors, (240), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) Word has length 308 [2022-11-18 20:38:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:01,254 INFO L225 Difference]: With dead ends: 4876 [2022-11-18 20:38:01,255 INFO L226 Difference]: Without dead ends: 3268 [2022-11-18 20:38:01,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 367 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=421, Invalid=4138, Unknown=1, NotChecked=132, Total=4692 [2022-11-18 20:38:01,264 INFO L413 NwaCegarLoop]: 1446 mSDtfsCounter, 4229 mSDsluCounter, 28337 mSDsCounter, 0 mSdLazyCounter, 36472 mSolverCounterSat, 1958 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4479 SdHoareTripleChecker+Valid, 29783 SdHoareTripleChecker+Invalid, 38432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 1958 IncrementalHoareTripleChecker+Valid, 36472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:01,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4479 Valid, 29783 Invalid, 38432 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [1958 Valid, 36472 Invalid, 2 Unknown, 0 Unchecked, 60.2s Time] [2022-11-18 20:38:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2022-11-18 20:38:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 2196. [2022-11-18 20:38:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 1605 states have (on average 1.3757009345794393) internal successors, (2208), 1649 states have internal predecessors, (2208), 456 states have call successors, (456), 128 states have call predecessors, (456), 134 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2022-11-18 20:38:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3140 transitions. [2022-11-18 20:38:01,746 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3140 transitions. Word has length 308 [2022-11-18 20:38:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:01,747 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 3140 transitions. [2022-11-18 20:38:01,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 6.486486486486487) internal successors, (240), 27 states have internal predecessors, (240), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) [2022-11-18 20:38:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3140 transitions. [2022-11-18 20:38:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-11-18 20:38:01,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:01,760 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:38:01,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:01,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:38:01,983 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1610720447, now seen corresponding path program 1 times [2022-11-18 20:38:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:38:01,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267704079] [2022-11-18 20:38:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:38:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:38:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:38:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:38:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:38:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:38:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:38:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:38:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:38:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:38:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:38:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:38:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:38:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:38:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:38:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 20:38:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:38:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-18 20:38:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-18 20:38:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-18 20:38:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-18 20:38:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-18 20:38:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-11-18 20:38:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-11-18 20:38:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-18 20:38:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-11-18 20:38:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-18 20:38:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-18 20:38:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2022-11-18 20:38:03,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:38:03,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267704079] [2022-11-18 20:38:03,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267704079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:03,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:03,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:38:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512283234] [2022-11-18 20:38:03,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:03,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:38:03,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:38:03,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:38:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:38:03,494 INFO L87 Difference]: Start difference. First operand 2196 states and 3140 transitions. Second operand has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-18 20:38:09,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:12,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:15,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:26,335 INFO L93 Difference]: Finished difference Result 5357 states and 8067 transitions. [2022-11-18 20:38:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:38:26,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 314 [2022-11-18 20:38:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:26,354 INFO L225 Difference]: With dead ends: 5357 [2022-11-18 20:38:26,354 INFO L226 Difference]: Without dead ends: 3751 [2022-11-18 20:38:26,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:38:26,362 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 2954 mSDsluCounter, 8819 mSDsCounter, 0 mSdLazyCounter, 8832 mSolverCounterSat, 1239 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3114 SdHoareTripleChecker+Valid, 10360 SdHoareTripleChecker+Invalid, 10074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1239 IncrementalHoareTripleChecker+Valid, 8832 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:26,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3114 Valid, 10360 Invalid, 10074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1239 Valid, 8832 Invalid, 3 Unknown, 0 Unchecked, 21.5s Time] [2022-11-18 20:38:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2022-11-18 20:38:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 2199. [2022-11-18 20:38:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1608 states have (on average 1.375) internal successors, (2211), 1651 states have internal predecessors, (2211), 456 states have call successors, (456), 128 states have call predecessors, (456), 134 states have return successors, (476), 455 states have call predecessors, (476), 456 states have call successors, (476) [2022-11-18 20:38:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3143 transitions. [2022-11-18 20:38:26,937 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3143 transitions. Word has length 314 [2022-11-18 20:38:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:26,938 INFO L495 AbstractCegarLoop]: Abstraction has 2199 states and 3143 transitions. [2022-11-18 20:38:26,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-18 20:38:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3143 transitions. [2022-11-18 20:38:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-11-18 20:38:26,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:26,950 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:38:26,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:38:26,951 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1337177254, now seen corresponding path program 2 times [2022-11-18 20:38:26,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:38:26,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067056416] [2022-11-18 20:38:26,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:38:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:38:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:38:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:38:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:38:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:38:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:38:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:38:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:38:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:38:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:38:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:38:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:38:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:38:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:38:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 20:38:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:38:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-18 20:38:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-18 20:38:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:38:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:38:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-18 20:38:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-18 20:38:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:38:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-18 20:38:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-18 20:38:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-18 20:38:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-11-18 20:38:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-18 20:38:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-11-18 20:38:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-11-18 20:38:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-11-18 20:38:28,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:38:28,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067056416] [2022-11-18 20:38:28,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067056416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:38:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453890013] [2022-11-18 20:38:28,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:38:28,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:38:28,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:38:28,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:38:28,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:39:10,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:39:10,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:39:10,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 2362 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:39:10,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:39:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 244 proven. 1 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-11-18 20:39:10,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:39:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-11-18 20:39:11,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453890013] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:39:11,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:39:11,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2022-11-18 20:39:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823148583] [2022-11-18 20:39:11,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:39:11,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:39:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:39:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:39:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:39:11,184 INFO L87 Difference]: Start difference. First operand 2199 states and 3143 transitions. Second operand has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 10 states have internal predecessors, (185), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2022-11-18 20:39:16,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:39:19,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:39:20,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:39:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:39:30,104 INFO L93 Difference]: Finished difference Result 4853 states and 7024 transitions. [2022-11-18 20:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:39:30,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 10 states have internal predecessors, (185), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 320 [2022-11-18 20:39:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:39:30,121 INFO L225 Difference]: With dead ends: 4853 [2022-11-18 20:39:30,122 INFO L226 Difference]: Without dead ends: 2679 [2022-11-18 20:39:30,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2022-11-18 20:39:30,131 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 2286 mSDsluCounter, 5131 mSDsCounter, 0 mSdLazyCounter, 7672 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 5911 SdHoareTripleChecker+Invalid, 9006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 7672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:39:30,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 5911 Invalid, 9006 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1334 Valid, 7672 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2022-11-18 20:39:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2022-11-18 20:39:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2209. [2022-11-18 20:39:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1617 states have (on average 1.3747680890538034) internal successors, (2223), 1660 states have internal predecessors, (2223), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 455 states have call predecessors, (476), 456 states have call successors, (476) [2022-11-18 20:39:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3155 transitions. [2022-11-18 20:39:30,692 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3155 transitions. Word has length 320 [2022-11-18 20:39:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:39:30,693 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 3155 transitions. [2022-11-18 20:39:30,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 10 states have internal predecessors, (185), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2022-11-18 20:39:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3155 transitions. [2022-11-18 20:39:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-11-18 20:39:30,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:39:30,707 INFO L195 NwaCegarLoop]: trace histogram [24, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:39:30,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:39:30,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:39:30,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:39:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:39:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1971117133, now seen corresponding path program 3 times [2022-11-18 20:39:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:39:30,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515465976] [2022-11-18 20:39:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:39:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:39:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:39:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:39:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:39:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:39:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:39:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:39:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:39:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:39:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:39:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:39:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:39:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:39:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:39:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:39:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:39:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:39:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:39:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 20:39:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 20:39:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:39:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:39:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-18 20:39:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:39:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-18 20:39:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:39:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:39:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-18 20:39:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-18 20:39:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:39:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-18 20:39:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-18 20:39:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-11-18 20:39:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-11-18 20:39:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-18 20:39:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-18 20:39:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-11-18 20:39:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:39:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2022-11-18 20:39:32,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:39:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515465976] [2022-11-18 20:39:32,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515465976] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:39:32,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682568349] [2022-11-18 20:39:32,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:39:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:39:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:39:32,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:39:32,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:41:27,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 20:41:27,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:41:27,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 221 conjunts are in the unsatisfiable core [2022-11-18 20:41:27,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:41:27,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:41:27,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:41:27,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:41:27,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:41:28,008 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:41:28,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:41:28,104 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:41:28,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:41:28,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:41:28,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ldv_malloc_~p~0.base_BEFORE_CALL_1 Int)) (= (select |c_#valid| v_ldv_malloc_~p~0.base_BEFORE_CALL_1) 1)) (exists ((|ldv_init_zalloc_#t~malloc17.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc17.base| 1)))) is different from true [2022-11-18 20:41:28,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:41:28,267 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:41:28,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2022-11-18 20:41:28,655 INFO L321 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2022-11-18 20:41:28,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 39 [2022-11-18 20:41:29,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:41:29,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-18 20:41:29,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:41:29,288 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-18 20:41:29,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2022-11-18 20:41:29,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:41:29,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:41:29,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:41:29,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:29,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:29,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-18 20:41:30,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:41:30,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:41:30,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:30,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:41:30,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 20:41:30,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 20:41:30,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:30,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:30,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-18 20:41:30,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-18 20:41:30,891 INFO L321 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2022-11-18 20:41:30,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 47 [2022-11-18 20:41:30,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-11-18 20:41:30,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:30,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 20:41:30,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:41:31,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:41:31,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-18 20:41:31,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,309 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-11-18 20:41:31,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 78 [2022-11-18 20:41:31,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 20:41:31,353 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:41:31,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2022-11-18 20:41:31,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:41:31,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:41:31,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:41:31,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:31,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:41:31,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-18 20:41:32,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:41:32,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:41:32,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:32,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-18 20:41:33,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 235 [2022-11-18 20:41:33,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:33,609 INFO L321 Elim1Store]: treesize reduction 33, result has 29.8 percent of original size [2022-11-18 20:41:33,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 331 treesize of output 228 [2022-11-18 20:41:33,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:41:33,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 162 [2022-11-18 20:41:33,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 140 [2022-11-18 20:41:33,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 123 [2022-11-18 20:41:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 178 proven. 19 refuted. 0 times theorem prover too weak. 737 trivial. 5 not checked. [2022-11-18 20:41:33,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:41:33,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4110 (Array Int Int)) (v_ArrVal_4111 (Array Int Int)) (v_ArrVal_4109 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_4109) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_4110) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_4111) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (< .cse0 1)))) is different from false [2022-11-18 20:41:33,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682568349] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:41:33,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:41:33,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 38] total 47 [2022-11-18 20:41:33,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401188284] [2022-11-18 20:41:33,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:41:33,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-18 20:41:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:41:33,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-18 20:41:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1947, Unknown=2, NotChecked=178, Total=2256 [2022-11-18 20:41:33,999 INFO L87 Difference]: Start difference. First operand 2209 states and 3155 transitions. Second operand has 47 states, 46 states have (on average 5.608695652173913) internal successors, (258), 36 states have internal predecessors, (258), 14 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (54), 16 states have call predecessors, (54), 14 states have call successors, (54) [2022-11-18 20:41:41,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:04,496 INFO L93 Difference]: Finished difference Result 11038 states and 17757 transitions. [2022-11-18 20:43:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-18 20:43:04,497 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 5.608695652173913) internal successors, (258), 36 states have internal predecessors, (258), 14 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (54), 16 states have call predecessors, (54), 14 states have call successors, (54) Word has length 337 [2022-11-18 20:43:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:04,546 INFO L225 Difference]: With dead ends: 11038 [2022-11-18 20:43:04,547 INFO L226 Difference]: Without dead ends: 8858 [2022-11-18 20:43:04,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 386 SyntacticMatches, 24 SemanticMatches, 120 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4541 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=875, Invalid=13411, Unknown=2, NotChecked=474, Total=14762 [2022-11-18 20:43:04,563 INFO L413 NwaCegarLoop]: 2827 mSDtfsCounter, 8911 mSDsluCounter, 69248 mSDsCounter, 0 mSdLazyCounter, 74203 mSolverCounterSat, 5046 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9153 SdHoareTripleChecker+Valid, 72075 SdHoareTripleChecker+Invalid, 100033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.9s SdHoareTripleChecker+Time, 5046 IncrementalHoareTripleChecker+Valid, 74203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20783 IncrementalHoareTripleChecker+Unchecked, 80.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:04,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9153 Valid, 72075 Invalid, 100033 Unknown, 0 Unchecked, 0.9s Time], IncrementalHoareTripleChecker [5046 Valid, 74203 Invalid, 1 Unknown, 20783 Unchecked, 80.9s Time] [2022-11-18 20:43:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8858 states. [2022-11-18 20:43:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8858 to 3647. [2022-11-18 20:43:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3647 states, 2669 states have (on average 1.3754215061820907) internal successors, (3671), 2755 states have internal predecessors, (3671), 757 states have call successors, (757), 211 states have call predecessors, (757), 220 states have return successors, (813), 738 states have call predecessors, (813), 757 states have call successors, (813) [2022-11-18 20:43:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 5241 transitions. [2022-11-18 20:43:05,607 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 5241 transitions. Word has length 337 [2022-11-18 20:43:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:05,608 INFO L495 AbstractCegarLoop]: Abstraction has 3647 states and 5241 transitions. [2022-11-18 20:43:05,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 5.608695652173913) internal successors, (258), 36 states have internal predecessors, (258), 14 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (54), 16 states have call predecessors, (54), 14 states have call successors, (54) [2022-11-18 20:43:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 5241 transitions. [2022-11-18 20:43:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2022-11-18 20:43:05,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:05,628 INFO L195 NwaCegarLoop]: trace histogram [26, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:43:05,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:05,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:43:05,844 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:43:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash 514806036, now seen corresponding path program 1 times [2022-11-18 20:43:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:05,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983651432] [2022-11-18 20:43:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:43:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:43:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:43:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:43:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:43:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:43:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:43:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:43:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:43:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-18 20:43:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:43:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-18 20:43:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-18 20:43:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-18 20:43:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-18 20:43:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-18 20:43:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-18 20:43:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-18 20:43:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-11-18 20:43:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-11-18 20:43:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-18 20:43:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-11-18 20:43:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-18 20:43:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-11-18 20:43:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 46 proven. 94 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2022-11-18 20:43:07,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:07,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983651432] [2022-11-18 20:43:07,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983651432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:07,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54011055] [2022-11-18 20:43:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:07,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:07,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:08,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:43:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:09,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 2661 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:43:09,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2022-11-18 20:43:09,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:09,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54011055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:09,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:09,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-11-18 20:43:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628381271] [2022-11-18 20:43:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:09,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:09,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:43:09,415 INFO L87 Difference]: Start difference. First operand 3647 states and 5241 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-11-18 20:43:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:10,518 INFO L93 Difference]: Finished difference Result 8296 states and 11959 transitions. [2022-11-18 20:43:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:43:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 343 [2022-11-18 20:43:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:10,540 INFO L225 Difference]: With dead ends: 8296 [2022-11-18 20:43:10,541 INFO L226 Difference]: Without dead ends: 5236 [2022-11-18 20:43:10,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:43:10,556 INFO L413 NwaCegarLoop]: 3036 mSDtfsCounter, 1484 mSDsluCounter, 7604 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 10640 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:10,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 10640 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:43:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2022-11-18 20:43:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5202. [2022-11-18 20:43:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5202 states, 3818 states have (on average 1.3816134101623887) internal successors, (5275), 3937 states have internal predecessors, (5275), 1073 states have call successors, (1073), 297 states have call predecessors, (1073), 310 states have return successors, (1143), 1052 states have call predecessors, (1143), 1073 states have call successors, (1143) [2022-11-18 20:43:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 7491 transitions. [2022-11-18 20:43:11,996 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 7491 transitions. Word has length 343 [2022-11-18 20:43:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:11,996 INFO L495 AbstractCegarLoop]: Abstraction has 5202 states and 7491 transitions. [2022-11-18 20:43:11,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-11-18 20:43:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 7491 transitions. [2022-11-18 20:43:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-11-18 20:43:12,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:12,021 INFO L195 NwaCegarLoop]: trace histogram [26, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:43:12,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:12,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:12,235 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:43:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash -148225205, now seen corresponding path program 1 times [2022-11-18 20:43:12,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:12,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189248232] [2022-11-18 20:43:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:12,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:43:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:43:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:43:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:43:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:43:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:43:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:43:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:43:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:43:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-18 20:43:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:43:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-18 20:43:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-18 20:43:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-18 20:43:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-18 20:43:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-11-18 20:43:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-11-18 20:43:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-11-18 20:43:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-18 20:43:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-18 20:43:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-11-18 20:43:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-18 20:43:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2022-11-18 20:43:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2022-11-18 20:43:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:12,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189248232] [2022-11-18 20:43:12,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189248232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:12,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:12,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:43:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578528549] [2022-11-18 20:43:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:12,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:43:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:43:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:43:12,904 INFO L87 Difference]: Start difference. First operand 5202 states and 7491 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-18 20:43:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:22,271 INFO L93 Difference]: Finished difference Result 11293 states and 16499 transitions. [2022-11-18 20:43:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:43:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 341 [2022-11-18 20:43:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:22,298 INFO L225 Difference]: With dead ends: 11293 [2022-11-18 20:43:22,298 INFO L226 Difference]: Without dead ends: 6149 [2022-11-18 20:43:22,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:43:22,315 INFO L413 NwaCegarLoop]: 784 mSDtfsCounter, 2232 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 1302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 4660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1302 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:22,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2256 Valid, 3292 Invalid, 4660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1302 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-18 20:43:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6149 states. [2022-11-18 20:43:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6149 to 5188. [2022-11-18 20:43:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 3804 states have (on average 1.379074658254469) internal successors, (5246), 3923 states have internal predecessors, (5246), 1073 states have call successors, (1073), 297 states have call predecessors, (1073), 310 states have return successors, (1142), 1052 states have call predecessors, (1142), 1073 states have call successors, (1142) [2022-11-18 20:43:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7461 transitions. [2022-11-18 20:43:23,380 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7461 transitions. Word has length 341 [2022-11-18 20:43:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:23,381 INFO L495 AbstractCegarLoop]: Abstraction has 5188 states and 7461 transitions. [2022-11-18 20:43:23,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-18 20:43:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7461 transitions. [2022-11-18 20:43:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-11-18 20:43:23,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:23,401 INFO L195 NwaCegarLoop]: trace histogram [26, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:43:23,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:43:23,401 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:43:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1015955732, now seen corresponding path program 1 times [2022-11-18 20:43:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:23,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149169831] [2022-11-18 20:43:23,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:43:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:43:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:43:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:43:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:43:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:43:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:43:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:43:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:24,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:43:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:43:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:43:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-18 20:43:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:43:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-18 20:43:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-18 20:43:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-18 20:43:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:43:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:43:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-18 20:43:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-18 20:43:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:43:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-18 20:43:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-11-18 20:43:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-11-18 20:43:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-18 20:43:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-11-18 20:43:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-11-18 20:43:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-11-18 20:43:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 46 proven. 94 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2022-11-18 20:43:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:25,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149169831] [2022-11-18 20:43:25,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149169831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:25,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457812088] [2022-11-18 20:43:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:25,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:25,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:25,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:25,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:43:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:29,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-18 20:43:29,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 533 proven. 63 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2022-11-18 20:43:29,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:43:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 46 proven. 94 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2022-11-18 20:43:30,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457812088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:43:30,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:43:30,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 22 [2022-11-18 20:43:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036529440] [2022-11-18 20:43:30,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:43:30,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:43:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:30,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:43:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:43:30,359 INFO L87 Difference]: Start difference. First operand 5188 states and 7461 transitions. Second operand has 22 states, 22 states have (on average 8.909090909090908) internal successors, (196), 17 states have internal predecessors, (196), 2 states have call successors, (72), 7 states have call predecessors, (72), 5 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2022-11-18 20:43:37,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:39,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:43,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:43:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:43:54,499 INFO L93 Difference]: Finished difference Result 11313 states and 16431 transitions. [2022-11-18 20:43:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:43:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.909090909090908) internal successors, (196), 17 states have internal predecessors, (196), 2 states have call successors, (72), 7 states have call predecessors, (72), 5 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 342 [2022-11-18 20:43:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:43:54,526 INFO L225 Difference]: With dead ends: 11313 [2022-11-18 20:43:54,527 INFO L226 Difference]: Without dead ends: 6154 [2022-11-18 20:43:54,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=426, Invalid=1380, Unknown=0, NotChecked=0, Total=1806 [2022-11-18 20:43:54,542 INFO L413 NwaCegarLoop]: 778 mSDtfsCounter, 1863 mSDsluCounter, 5781 mSDsCounter, 0 mSdLazyCounter, 8859 mSolverCounterSat, 1078 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1887 SdHoareTripleChecker+Valid, 6559 SdHoareTripleChecker+Invalid, 9938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 8859 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:43:54,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1887 Valid, 6559 Invalid, 9938 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1078 Valid, 8859 Invalid, 1 Unknown, 0 Unchecked, 21.0s Time] [2022-11-18 20:43:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2022-11-18 20:43:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 5193. [2022-11-18 20:43:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 3809 states have (on average 1.3785770543449725) internal successors, (5251), 3928 states have internal predecessors, (5251), 1073 states have call successors, (1073), 297 states have call predecessors, (1073), 310 states have return successors, (1142), 1052 states have call predecessors, (1142), 1073 states have call successors, (1142) [2022-11-18 20:43:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 7466 transitions. [2022-11-18 20:43:55,947 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 7466 transitions. Word has length 342 [2022-11-18 20:43:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:43:55,947 INFO L495 AbstractCegarLoop]: Abstraction has 5193 states and 7466 transitions. [2022-11-18 20:43:55,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.909090909090908) internal successors, (196), 17 states have internal predecessors, (196), 2 states have call successors, (72), 7 states have call predecessors, (72), 5 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2022-11-18 20:43:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 7466 transitions. [2022-11-18 20:43:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-11-18 20:43:55,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:43:55,965 INFO L195 NwaCegarLoop]: trace histogram [36, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:43:55,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:56,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-18 20:43:56,179 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:43:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:56,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2107311216, now seen corresponding path program 2 times [2022-11-18 20:43:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:56,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951821052] [2022-11-18 20:43:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:56,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:44:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:44:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:44:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:44:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:44:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:44:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:44:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:44:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:44:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:44:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:44:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:44:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:44:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:44:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:44:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 20:44:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:44:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:44:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-18 20:44:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:44:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:44:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-18 20:44:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:44:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-18 20:44:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:44:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:44:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-18 20:44:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-11-18 20:44:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:44:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-18 20:44:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-18 20:44:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-11-18 20:44:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-18 20:44:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-11-18 20:44:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-11-18 20:44:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-11-18 20:44:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2022-11-18 20:44:02,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:44:02,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951821052] [2022-11-18 20:44:02,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951821052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:44:02,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804648578] [2022-11-18 20:44:02,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:44:02,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:44:02,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:44:02,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:44:02,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:45:46,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:45:46,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:45:46,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-18 20:45:46,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:46,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:45:46,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:45:46,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 56 [2022-11-18 20:45:46,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:45:46,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:45:46,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:45:46,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 50 [2022-11-18 20:45:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 208 proven. 215 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2022-11-18 20:45:47,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:45:47,667 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-18 20:45:47,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 63 [2022-11-18 20:45:47,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:45:47,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2022-11-18 20:45:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1377 trivial. 0 not checked. [2022-11-18 20:45:48,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804648578] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:45:48,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:45:48,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [20, 18] total 29 [2022-11-18 20:45:48,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329755701] [2022-11-18 20:45:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:45:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:45:48,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:45:48,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-11-18 20:45:48,065 INFO L87 Difference]: Start difference. First operand 5193 states and 7466 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-18 20:45:50,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:45:52,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:45:58,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:15,597 INFO L93 Difference]: Finished difference Result 25151 states and 39526 transitions. [2022-11-18 20:46:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:46:15,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 352 [2022-11-18 20:46:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:15,703 INFO L225 Difference]: With dead ends: 25151 [2022-11-18 20:46:15,703 INFO L226 Difference]: Without dead ends: 20562 [2022-11-18 20:46:15,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 783 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=208, Invalid=1772, Unknown=0, NotChecked=0, Total=1980 [2022-11-18 20:46:15,726 INFO L413 NwaCegarLoop]: 3507 mSDtfsCounter, 5103 mSDsluCounter, 14685 mSDsCounter, 0 mSdLazyCounter, 3393 mSolverCounterSat, 1136 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5306 SdHoareTripleChecker+Valid, 18192 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 3393 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:15,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5306 Valid, 18192 Invalid, 4532 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1136 Valid, 3393 Invalid, 3 Unknown, 0 Unchecked, 18.8s Time] [2022-11-18 20:46:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20562 states. [2022-11-18 20:46:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20562 to 8469. [2022-11-18 20:46:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8469 states, 6235 states have (on average 1.3967923015236567) internal successors, (8709), 6448 states have internal predecessors, (8709), 1694 states have call successors, (1694), 520 states have call predecessors, (1694), 539 states have return successors, (1935), 1607 states have call predecessors, (1935), 1694 states have call successors, (1935) [2022-11-18 20:46:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8469 states to 8469 states and 12338 transitions. [2022-11-18 20:46:18,165 INFO L78 Accepts]: Start accepts. Automaton has 8469 states and 12338 transitions. Word has length 352 [2022-11-18 20:46:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:18,166 INFO L495 AbstractCegarLoop]: Abstraction has 8469 states and 12338 transitions. [2022-11-18 20:46:18,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-18 20:46:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8469 states and 12338 transitions. [2022-11-18 20:46:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-11-18 20:46:18,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:18,205 INFO L195 NwaCegarLoop]: trace histogram [36, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:46:18,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:46:18,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:46:18,431 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash 317879608, now seen corresponding path program 1 times [2022-11-18 20:46:18,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:18,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200169916] [2022-11-18 20:46:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:46:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:46:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:46:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:46:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:46:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:46:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:46:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 20:46:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:46:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 20:46:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:46:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:46:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-18 20:46:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:46:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-18 20:46:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-18 20:46:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-18 20:46:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-18 20:46:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-18 20:46:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-18 20:46:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-11-18 20:46:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2022-11-18 20:46:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2022-11-18 20:46:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2022-11-18 20:46:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-11-18 20:46:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-11-18 20:46:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2022-11-18 20:46:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:19,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200169916] [2022-11-18 20:46:19,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200169916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:46:19,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705415166] [2022-11-18 20:46:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:46:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:46:19,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:46:19,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:46:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:21,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 2841 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:46:21,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:46:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2022-11-18 20:46:21,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:46:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2022-11-18 20:46:22,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705415166] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:46:22,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:46:22,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 5] total 15 [2022-11-18 20:46:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470586954] [2022-11-18 20:46:22,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:46:22,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:46:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:46:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:46:22,389 INFO L87 Difference]: Start difference. First operand 8469 states and 12338 transitions. Second operand has 15 states, 15 states have (on average 17.2) internal successors, (258), 10 states have internal predecessors, (258), 7 states have call successors, (86), 8 states have call predecessors, (86), 3 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2022-11-18 20:46:25,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:44,871 INFO L93 Difference]: Finished difference Result 28445 states and 45232 transitions. [2022-11-18 20:46:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:46:44,872 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 10 states have internal predecessors, (258), 7 states have call successors, (86), 8 states have call predecessors, (86), 3 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) Word has length 361 [2022-11-18 20:46:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:44,966 INFO L225 Difference]: With dead ends: 28445 [2022-11-18 20:46:44,966 INFO L226 Difference]: Without dead ends: 20580 [2022-11-18 20:46:44,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2022-11-18 20:46:44,998 INFO L413 NwaCegarLoop]: 1152 mSDtfsCounter, 9890 mSDsluCounter, 4924 mSDsCounter, 0 mSdLazyCounter, 7802 mSolverCounterSat, 5271 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10305 SdHoareTripleChecker+Valid, 6076 SdHoareTripleChecker+Invalid, 13074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5271 IncrementalHoareTripleChecker+Valid, 7802 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:44,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10305 Valid, 6076 Invalid, 13074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5271 Valid, 7802 Invalid, 1 Unknown, 0 Unchecked, 14.3s Time] [2022-11-18 20:46:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20580 states. [2022-11-18 20:46:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20580 to 8896. [2022-11-18 20:46:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8896 states, 6536 states have (on average 1.3909118727050183) internal successors, (9091), 6780 states have internal predecessors, (9091), 1766 states have call successors, (1766), 520 states have call predecessors, (1766), 593 states have return successors, (2175), 1690 states have call predecessors, (2175), 1766 states have call successors, (2175) [2022-11-18 20:46:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8896 states to 8896 states and 13032 transitions. [2022-11-18 20:46:47,509 INFO L78 Accepts]: Start accepts. Automaton has 8896 states and 13032 transitions. Word has length 361 [2022-11-18 20:46:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:47,510 INFO L495 AbstractCegarLoop]: Abstraction has 8896 states and 13032 transitions. [2022-11-18 20:46:47,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 10 states have internal predecessors, (258), 7 states have call successors, (86), 8 states have call predecessors, (86), 3 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2022-11-18 20:46:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 8896 states and 13032 transitions. [2022-11-18 20:46:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2022-11-18 20:46:47,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:47,541 INFO L195 NwaCegarLoop]: trace histogram [36, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 20:46:47,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-18 20:46:47,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-18 20:46:47,742 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1007609911, now seen corresponding path program 1 times [2022-11-18 20:46:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:47,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731220645] [2022-11-18 20:46:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:46:51,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:46:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:46:53,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:46:53,181 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:46:53,181 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:46:53,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:46:53,186 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:46:53,190 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:46:53,251 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,252 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,253 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,253 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,253 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,254 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,254 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,254 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,255 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,255 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,255 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,256 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,256 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,256 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,256 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,257 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,257 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,257 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,257 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,258 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,259 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,259 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,259 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,260 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,260 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,260 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,261 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,261 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,261 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,262 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,262 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,262 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,262 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,263 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,263 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,263 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,263 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,264 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,264 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,264 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,265 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,265 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,266 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,266 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,266 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,266 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,267 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,267 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,267 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,267 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,268 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,268 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,268 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,268 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,269 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,269 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,269 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,269 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,270 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,270 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,270 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,270 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,271 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,271 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,271 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,271 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,271 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,272 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,272 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,272 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,273 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,273 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,273 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,273 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,274 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,274 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,274 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,274 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,275 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,275 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,275 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,275 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,277 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,277 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,285 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,285 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,285 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,285 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,286 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,286 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,286 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,286 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,286 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,287 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,287 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,287 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,287 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,288 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,288 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,288 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,288 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,288 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,289 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,289 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,290 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,290 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,290 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,290 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,290 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,291 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,291 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,291 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,291 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,292 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,292 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,292 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,292 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,293 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,293 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,293 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-18 20:46:53,293 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,293 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-18 20:46:53,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:46:53 BoogieIcfgContainer [2022-11-18 20:46:53,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:46:53,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:46:53,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:46:53,615 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:46:53,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:14" (3/4) ... [2022-11-18 20:46:53,619 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:46:53,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:46:53,621 INFO L158 Benchmark]: Toolchain (without parser) took 768075.84ms. Allocated memory was 125.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 81.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 512.6MB. Max. memory is 16.1GB. [2022-11-18 20:46:53,621 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:46:53,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2769.80ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 80.9MB in the beginning and 115.3MB in the end (delta: -34.4MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-11-18 20:46:53,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 230.63ms. Allocated memory is still 165.7MB. Free memory was 115.3MB in the beginning and 98.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 20:46:53,622 INFO L158 Benchmark]: Boogie Preprocessor took 216.58ms. Allocated memory is still 165.7MB. Free memory was 98.3MB in the beginning and 79.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:46:53,629 INFO L158 Benchmark]: RCFGBuilder took 5366.86ms. Allocated memory was 165.7MB in the beginning and 289.4MB in the end (delta: 123.7MB). Free memory was 79.5MB in the beginning and 137.3MB in the end (delta: -57.9MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-11-18 20:46:53,630 INFO L158 Benchmark]: TraceAbstraction took 759475.77ms. Allocated memory was 289.4MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 136.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-18 20:46:53,630 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 1.7GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:46:53,632 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.26ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2769.80ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 80.9MB in the beginning and 115.3MB in the end (delta: -34.4MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 230.63ms. Allocated memory is still 165.7MB. Free memory was 115.3MB in the beginning and 98.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 216.58ms. Allocated memory is still 165.7MB. Free memory was 98.3MB in the beginning and 79.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * RCFGBuilder took 5366.86ms. Allocated memory was 165.7MB in the beginning and 289.4MB in the end (delta: 123.7MB). Free memory was 79.5MB in the beginning and 137.3MB in the end (delta: -57.9MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * TraceAbstraction took 759475.77ms. Allocated memory was 289.4MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 136.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 1.7GB. Free memory is still 1.2GB. 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_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access 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_#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_#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_#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_#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_#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_#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_#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_#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 * 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: 7652]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 4943, overapproximation of shiftRight at line 4722, overapproximation of bitwiseAnd at line 4722. Possible FailurePath: [L4958] struct net_device *sl_netdev_ops_group1 ; [L4957] struct timer_list *ldv_timer_list_1 ; [L4952] struct timer_list *ldv_timer_list_2 ; [L4959] int ldv_state_variable_4 ; [L5961-L5964] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L4947] int LDV_IN_INTERRUPT = 1; [L5145] static struct net_device **slip_devs ; [L7015] int ldv_retval_0 ; [L7016] int ldv_retval_1 ; [L4955] int ref_cnt ; [L7020] int ldv_retval_2 ; [L7019] int ldv_retval_3 ; [L4948] int ldv_timer_state_2 = 0; [L4953] int ldv_timer_state_1 = 0; [L4954] int ldv_state_variable_2 ; [L4951] int ldv_state_variable_3 ; [L4949] int ldv_state_variable_0 ; [L4956] int ldv_state_variable_1 ; [L5146] static int slip_maxdev = 256; [L4950] struct tty_struct *sl_ldisc_group1 ; [L6833-L6836] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L7135] struct sk_buff *ldvarg1 ; [L7136] void *tmp ; [L7137] struct ifreq *ldvarg4 ; [L7138] void *tmp___0 ; [L7139] int ldvarg3 ; [L7140] struct rtnl_link_stats64 *ldvarg0 ; [L7141] void *tmp___1 ; [L7142] int ldvarg2 ; [L7143] unsigned long ldvarg11 ; [L7144] struct file *ldvarg7 ; [L7145] unsigned int ldvarg12 ; [L7146] unsigned long ldvarg5 ; [L7147] unsigned int ldvarg6 ; [L7148] int ldvarg8 ; [L7149] struct file *ldvarg13 ; [L7150] unsigned char *ldvarg10 ; [L7151] void *tmp___4 ; [L7152] char *ldvarg9 ; [L7153] void *tmp___5 ; [L7154] int tmp___6 ; [L7155] int tmp___7 ; [L7156] int tmp___8 ; [L7157] int tmp___9 ; VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L7159] CALL, EXPR ldv_init_zalloc(240UL) VAL [\old(size)=240, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=240, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=240, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=240, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L4780] return (p); VAL [\old(size)=240, \result={-18446744073709551617:0}, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L7159] RET, EXPR ldv_init_zalloc(240UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(240UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L7159] tmp = ldv_init_zalloc(240UL) [L7160] ldvarg1 = (struct sk_buff *)tmp VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L7161] CALL, EXPR ldv_init_zalloc(40UL) VAL [\old(size)=40, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=40, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=40, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103233:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=40, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103233:0}] [L4780] return (p); VAL [\old(size)=40, \result={-36893488147419103233:0}, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103233:0}] [L7161] RET, EXPR ldv_init_zalloc(40UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(40UL)={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L7161] tmp___0 = ldv_init_zalloc(40UL) [L7162] ldvarg4 = (struct ifreq *)tmp___0 VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}] [L7163] CALL, EXPR ldv_init_zalloc(184UL) VAL [\old(size)=184, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=184, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=184, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-55340232221128654849:0}, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-55340232221128654849:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=184, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-55340232221128654849:0}, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-55340232221128654849:0}] [L4780] return (p); VAL [\old(size)=184, \result={-55340232221128654849:0}, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-55340232221128654849:0}, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-55340232221128654849:0}] [L7163] RET, EXPR ldv_init_zalloc(184UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(184UL)={-55340232221128654849:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}] [L7163] tmp___1 = ldv_init_zalloc(184UL) [L7164] ldvarg0 = (struct rtnl_link_stats64 *)tmp___1 VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}] [L7165] CALL, EXPR ldv_malloc(sizeof(struct file)) VAL [\old(size)=316, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND TRUE tmp___0 != 0 [L4746] return ((void *)0); VAL [\old(size)=316, \result={0:0}, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=316, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp___0=1] [L7165] RET, EXPR ldv_malloc(sizeof(struct file)) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct file))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}] [L7165] ldvarg7 = ldv_malloc(sizeof(struct file)) [L7166] CALL, EXPR ldv_malloc(sizeof(struct file)) VAL [\old(size)=316, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND TRUE tmp___0 != 0 [L4746] return ((void *)0); VAL [\old(size)=316, \result={0:0}, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=316, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp___0=1] [L7166] RET, EXPR ldv_malloc(sizeof(struct file)) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct file))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}] [L7166] ldvarg13 = ldv_malloc(sizeof(struct file)) [L7167] CALL, EXPR ldv_init_zalloc(1UL) VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-92233720368547758081:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-92233720368547758081:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-92233720368547758081:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-92233720368547758081:0}] [L4780] return (p); VAL [\old(size)=1, \result={-92233720368547758081:0}, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-92233720368547758081:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-92233720368547758081:0}] [L7167] RET, EXPR ldv_init_zalloc(1UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1UL)={-92233720368547758081:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}] [L7167] tmp___4 = ldv_init_zalloc(1UL) [L7168] ldvarg10 = (unsigned char *)tmp___4 VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}] [L7169] CALL, EXPR ldv_init_zalloc(1UL) VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-110680464442257309697:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-110680464442257309697:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-110680464442257309697:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-110680464442257309697:0}] [L4780] return (p); VAL [\old(size)=1, \result={-110680464442257309697:0}, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-110680464442257309697:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-110680464442257309697:0}] [L7169] RET, EXPR ldv_init_zalloc(1UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1UL)={-110680464442257309697:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}] [L7169] tmp___5 = ldv_init_zalloc(1UL) [L7170] ldvarg9 = (char *)tmp___5 [L7171] FCALL ldv_initialize() [L7172] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={30:0}, __this_module={18446744073709551618:18446744073709551619}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={30:0}, s={30:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={30:0}] [L7172] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg3), 0, 4UL)={30:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7173] CALL ldv_memset((void *)(& ldvarg2), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={38:0}, __this_module={18446744073709551618:18446744073709551619}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={38:0}, s={38:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={38:0}] [L7173] RET ldv_memset((void *)(& ldvarg2), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg2), 0, 4UL)={38:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7174] CALL ldv_memset((void *)(& ldvarg11), 0, 8UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=8, \result={35:0}, __this_module={18446744073709551618:18446744073709551619}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=8, ref_cnt=0, s={35:0}, s={35:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={35:0}] [L7174] RET ldv_memset((void *)(& ldvarg11), 0, 8UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg11), 0, 8UL)={35:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7175] CALL ldv_memset((void *)(& ldvarg12), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={33:0}, __this_module={18446744073709551618:18446744073709551619}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={33:0}, s={33:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={33:0}] [L7175] RET ldv_memset((void *)(& ldvarg12), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg12), 0, 4UL)={33:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7176] CALL ldv_memset((void *)(& ldvarg5), 0, 8UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=8, \result={39:0}, __this_module={18446744073709551618:18446744073709551619}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=8, ref_cnt=0, s={39:0}, s={39:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={39:0}] [L7176] RET ldv_memset((void *)(& ldvarg5), 0, 8UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg5), 0, 8UL)={39:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7177] CALL ldv_memset((void *)(& ldvarg6), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={31:0}, __this_module={18446744073709551618:18446744073709551619}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={31:0}, s={31:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={31:0}] [L7177] RET ldv_memset((void *)(& ldvarg6), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg6), 0, 4UL)={31:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7178] CALL ldv_memset((void *)(& ldvarg8), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={42:0}, __this_module={18446744073709551618:18446744073709551619}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={42:0}, s={42:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={42:0}] [L7178] RET ldv_memset((void *)(& ldvarg8), 0, 4UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg8), 0, 4UL)={42:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7179] ldv_state_variable_4 = 0 [L7180] ldv_state_variable_1 = 1 [L7181] ref_cnt = 0 [L7182] ldv_state_variable_0 = 1 [L7183] ldv_state_variable_3 = 0 [L7184] ldv_state_variable_2 = 1 VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}] [L7186] tmp___6 = __VERIFIER_nondet_int() [L7188] case 0: [L7305] case 1: [L7311] case 2: VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}, tmp___6=2] [L7312] COND TRUE ldv_state_variable_0 != 0 [L7313] tmp___8 = __VERIFIER_nondet_int() [L7315] case 0: [L7323] case 1: VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}, tmp___6=2, tmp___8=1] [L7324] COND TRUE ldv_state_variable_0 == 1 [L7325] CALL, EXPR slip_init() [L6839] int status ; [L6840] void *tmp ; VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L6842] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L6850] CALL, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L4941] void *tmp ; VAL [\old(flags)=208, \old(size)=2048, __this_module={18446744073709551618:18446744073709551619}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4943] CALL, EXPR kmalloc(size, flags | 32768U) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4932] void *tmp___2 ; [L4934] CALL, EXPR __kmalloc(size, flags) [L4927] CALL, EXPR ldv_malloc(size) VAL [\old(size)=2048, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND FALSE !(tmp___0 != 0) [L4748] tmp = malloc(size) [L4749] p = tmp VAL [\old(size)=2048, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103231:0}, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103231:0}, tmp___0=0] [L4750] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4750] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2048, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103231:0}, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103231:0}, tmp___0=0] [L4751] return (p); VAL [\old(size)=2048, \result={-36893488147419103231:0}, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103231:0}, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103231:0}, tmp___0=0] [L4927] RET, EXPR ldv_malloc(size) VAL [\old(size)=2048, \old(t)=32768, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, t=32768] [L4927] return ldv_malloc(size); [L4934] RET, EXPR __kmalloc(size, flags) [L4934] tmp___2 = __kmalloc(size, flags) [L4935] return (tmp___2); VAL [\old(flags)=32768, \old(size)=2048, \result={-36893488147419103231:0}, __this_module={18446744073709551618:18446744073709551619}, flags=32768, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp___2={-36893488147419103231:0}] [L4943] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(size)=2048, __this_module={18446744073709551618:18446744073709551619}, flags=208, kmalloc(size, flags | 32768U)={-36893488147419103231:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4943] tmp = kmalloc(size, flags | 32768U) [L4944] return (tmp); VAL [\old(flags)=208, \old(size)=2048, \result={-36893488147419103231:0}, __this_module={18446744073709551618:18446744073709551619}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103231:0}] [L6850] RET, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6850] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6851] slip_devs = (struct net_device **)tmp VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-36893488147419103231:0}] [L6852] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6857] CALL, EXPR tty_register_ldisc(1, & sl_ldisc) [L7801] return __VERIFIER_nondet_int(); [L6857] RET, EXPR tty_register_ldisc(1, & sl_ldisc) [L6857] status = tty_register_ldisc(1, & sl_ldisc) [L6858] COND FALSE !(status != 0) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, status=0, tmp={-36893488147419103231:0}] [L6863] return (status); VAL [\result=0, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, status=0, tmp={-36893488147419103231:0}] [L7325] RET, EXPR slip_init() [L7325] ldv_retval_2 = slip_init() [L7326] COND FALSE !(ldv_retval_2 != 0) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}, tmp___6=2, tmp___8=1] [L7331] COND TRUE ldv_retval_2 == 0 [L7332] ldv_state_variable_0 = 2 [L7333] ldv_state_variable_3 = 1 [L7334] CALL ldv_target_type_3() [L7023] void *tmp ; VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7025] CALL, EXPR ldv_init_zalloc(2696UL) VAL [\old(size)=2696, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=2696, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=2696, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206465:0}, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-73786976294838206465:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2696, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206465:0}, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-73786976294838206465:0}] [L4780] return (p); VAL [\old(size)=2696, \result={-73786976294838206465:0}, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206465:0}, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-73786976294838206465:0}] [L7025] RET, EXPR ldv_init_zalloc(2696UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(2696UL)={-73786976294838206465:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7025] tmp = ldv_init_zalloc(2696UL) [L7026] sl_ldisc_group1 = (struct tty_struct *)tmp VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-73786976294838206465:0}] [L7334] RET ldv_target_type_3() [L7335] ldv_state_variable_4 = 1 [L7336] CALL ldv_net_device_ops_4() [L7032] void *tmp ; VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7034] CALL, EXPR ldv_init_zalloc(2496UL) VAL [\old(size)=2496, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=2496, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-129127208515966861313:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=2496, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-129127208515966861313:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-129127208515966861313:0}, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-129127208515966861313:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2496, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-129127208515966861313:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-129127208515966861313:0}, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-129127208515966861313:0}] [L4780] return (p); VAL [\old(size)=2496, \result={-129127208515966861313:0}, __this_module={18446744073709551618:18446744073709551619}, calloc(1UL, size)={-129127208515966861313:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-129127208515966861313:0}, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-129127208515966861313:0}] [L7034] RET, EXPR ldv_init_zalloc(2496UL) VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(2496UL)={-129127208515966861313:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7034] tmp = ldv_init_zalloc(2496UL) [L7035] sl_netdev_ops_group1 = (struct net_device *)tmp VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-129127208515966861313:0}] [L7336] RET ldv_net_device_ops_4() [L7186] tmp___6 = __VERIFIER_nondet_int() [L7188] case 0: [L7305] case 1: [L7311] case 2: [L7349] case 3: VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}, tmp___6=3, tmp___8=1] [L7350] COND TRUE ldv_state_variable_3 != 0 [L7351] tmp___9 = __VERIFIER_nondet_int() [L7353] case 0: [L7365] case 1: [L7377] case 2: [L7385] case 3: [L7392] case 4: VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-55340232221128654849:0}, ldvarg1={-18446744073709551617:0}, ldvarg10={-92233720368547758081:0}, ldvarg11={35:0}, ldvarg12={33:0}, ldvarg13={0:0}, ldvarg2={38:0}, ldvarg3={30:0}, ldvarg4={-36893488147419103233:0}, ldvarg5={39:0}, ldvarg6={31:0}, ldvarg7={0:0}, ldvarg8={42:0}, ldvarg9={-110680464442257309697:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-18446744073709551617:0}, tmp___0={-36893488147419103233:0}, tmp___1={-55340232221128654849:0}, tmp___4={-92233720368547758081:0}, tmp___5={-110680464442257309697:0}, tmp___6=3, tmp___8=1, tmp___9=4] [L7393] COND TRUE ldv_state_variable_3 == 1 [L7394] CALL ldv_slip_open_18(sl_ldisc_group1) [L7639] ldv_func_ret_type___16 ldv_func_res ; [L7640] int tmp ; [L7642] CALL, EXPR slip_open(tty) [L6147] struct slip *sl ; [L6148] int err ; [L6149] int tmp ; [L6150] dev_t tmp___0 ; [L6151] struct task_struct *tmp___1 ; [L6152] int tmp___2 ; [L6154] CALL, EXPR capable(12) [L7695] return __VERIFIER_nondet_int(); [L6154] RET, EXPR capable(12) [L6154] tmp = capable(12) [L6155] COND FALSE !(tmp == 0) [L6159] EXPR tty->ops [L6159] EXPR (tty->ops)->write VAL [(tty->ops)->write={-42:43}, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}, tty->ops={18446744073709551617:-3}] [L6159-L6161] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L6165] FCALL rtnl_lock() [L6166] CALL sl_sync() [L6036] int i ; [L6037] struct net_device *dev ; [L6038] struct slip *sl ; [L6039] void *tmp ; [L6041] i = 0 VAL [__this_module={18446744073709551618:18446744073709551619}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6062] COND TRUE i < slip_maxdev VAL [__this_module={18446744073709551618:18446744073709551619}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6044] EXPR slip_devs + (unsigned long )i [L6044] dev = *(slip_devs + (unsigned long )i) [L6045] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) VAL [__this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6049] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5014] return ((void *)dev + 2496U); VAL [\result={2434:63}, __this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, dev={2434:-2433}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6049] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, netdev_priv((struct net_device const *)dev)={2434:63}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6049] tmp = netdev_priv((struct net_device const *)dev) [L6050] sl = (struct slip *)tmp [L6051] EXPR sl->tty [L6051] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U VAL [(unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U=1, __this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2434:63}, sl->tty={47:-46}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2434:63}] [L6051] COND TRUE (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L6060] i = i + 1 VAL [__this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2434:63}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2434:63}] [L6062] COND TRUE i < slip_maxdev VAL [__this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2434:63}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2434:63}] [L6044] EXPR slip_devs + (unsigned long )i [L6044] dev = *(slip_devs + (unsigned long )i) [L6045] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={18446744073709551618:18446744073709551619}, dev={18446744073709551615:1}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2434:63}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2434:63}] [L6166] RET sl_sync() [L6167] EXPR tty->disc_data [L6167] sl = (struct slip *)tty->disc_data [L6168] err = -17 [L6169] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6169] EXPR sl->magic [L6169] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [(unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250=0, __this_module={18446744073709551618:18446744073709551619}, err=-17, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={-48:49}, sl->magic=-2, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6169] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6173] err = -23 VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={-48:49}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6174] CALL, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551618:18446744073709551619}, arg0={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7790] return __VERIFIER_nondet_uint(); [L6174] RET, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={-48:49}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}, tty_devnum(tty)=18446744073709551628] [L6174] tmp___0 = tty_devnum(tty) [L6175] CALL, EXPR sl_alloc(tmp___0) [L6072] int i ; [L6073] struct net_device *dev ; [L6074] struct slip *sl ; [L6075] void *tmp ; [L6076] int tmp___0 ; [L6077] char name[16U] ; [L6078] void *tmp___1 ; [L6079] struct lock_class_key __key ; [L6081] dev = (struct net_device *)0 VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6082] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6086] i = 0 VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6096] COND TRUE i < slip_maxdev VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6089] EXPR slip_devs + (unsigned long )i [L6089] dev = *(slip_devs + (unsigned long )i) [L6090] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6094] i = i + 1 VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6096] COND TRUE i < slip_maxdev VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={2434:-2433}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6089] EXPR slip_devs + (unsigned long )i [L6089] dev = *(slip_devs + (unsigned long )i) [L6090] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={18446744073709551615:1}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6101] COND FALSE !(i >= slip_maxdev) VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={18446744073709551615:1}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6105] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={18446744073709551615:1}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6117] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L6119] CALL, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L7691] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(size)=2255, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND FALSE !(tmp___0 != 0) [L4748] tmp = malloc(size) [L4749] p = tmp VAL [\old(size)=2255, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551615:0}, ref_cnt=0, size=2255, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-18446744073709551615:0}, tmp___0=0] [L4750] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551618:18446744073709551619}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4750] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2255, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551615:0}, ref_cnt=0, size=2255, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-18446744073709551615:0}, tmp___0=0] [L4751] return (p); VAL [\old(size)=2255, \result={-18446744073709551615:0}, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551615:0}, ref_cnt=0, size=2255, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-18446744073709551615:0}, tmp___0=0] [L7691] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=472, \old(arg3)=1, \old(arg4)=1, __this_module={18446744073709551618:18446744073709551619}, arg0=472, arg1={29:0}, arg1={29:0}, arg2={-1:10}, arg2={-1:10}, arg3=1, arg4=1, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7691] return ldv_malloc(sizeof(struct net_device)); [L6119] RET, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6119] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6120] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6124] dev->base_addr = (unsigned long )i VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6127] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5014] return ((void *)dev + 2496U); VAL [\result={-18446744073709551615:2496}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, dev={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6127] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, netdev_priv((struct net_device const *)dev)={-18446744073709551615:2496}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6127] tmp___1 = netdev_priv((struct net_device const *)dev) [L6128] sl = (struct slip *)tmp___1 [L6129] sl->magic = 21250 [L6130] sl->dev = dev [L6131] CALL spinlock_check(& sl->lock) [L4871] return (& lock->__annonCompField19.rlock); VAL [\result={-18446744073709551615:2516}, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, lock={-18446744073709551615:2516}, lock={-18446744073709551615:2516}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6131] RET spinlock_check(& sl->lock) [L6132-L6133] FCALL __raw_spin_lock_init(& sl->lock.__annonCompField19.rlock, "&(&sl->lock)->rlock", & __key) [L6134] sl->mode = 8U VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6135] CALL reg_timer_1(& sl->keepalive_timer) VAL [\old(ldv_timer_list_1)=0, \old(ldv_timer_list_1)=0, \old(ldv_timer_state_1)=0, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, timer={-18446744073709551615:2812}] [L7070] ldv_timer_list_1 = timer [L7071] ldv_timer_state_1 = 1 [L7072] return (0); VAL [\old(ldv_timer_list_1)=0, \old(ldv_timer_list_1)=0, \old(ldv_timer_state_1)=0, \result=0, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, timer={-18446744073709551615:2812}, timer={-18446744073709551615:2812}] [L6135] RET reg_timer_1(& sl->keepalive_timer) VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, reg_timer_1(& sl->keepalive_timer)=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6136] sl->keepalive_timer.data = (unsigned long )sl [L6137] sl->keepalive_timer.function = & sl_keepalive VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6138] CALL reg_timer_1(& sl->outfill_timer) VAL [\old(ldv_timer_list_1)=-18446744073709551615, \old(ldv_timer_list_1)=2812, \old(ldv_timer_state_1)=1, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, timer={-18446744073709551615:2688}] [L7070] ldv_timer_list_1 = timer [L7071] ldv_timer_state_1 = 1 [L7072] return (0); VAL [\old(ldv_timer_list_1)=2812, \old(ldv_timer_list_1)=-18446744073709551615, \old(ldv_timer_state_1)=1, \result=0, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, timer={-18446744073709551615:2688}, timer={-18446744073709551615:2688}] [L6138] RET reg_timer_1(& sl->outfill_timer) VAL [\old(line)=12, __key={50:0}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=12, name={29:0}, ref_cnt=0, reg_timer_1(& sl->outfill_timer)=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6139] sl->outfill_timer.data = (unsigned long )sl [L6140] sl->outfill_timer.function = & sl_outfill [L6141] *(slip_devs + (unsigned long )i) = dev [L6142] return (sl); [L6142] return (sl); [L6142] return (sl); VAL [\old(line)=12, \result={-18446744073709551615:2496}, __this_module={18446744073709551618:18446744073709551619}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=12, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6175] RET, EXPR sl_alloc(tmp___0) [L6175] sl = sl_alloc(tmp___0) [L6176] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6180] sl->tty = tty [L6181] tty->disc_data = (void *)sl VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6182] CALL, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551618:18446744073709551619}, arg0={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7790] return __VERIFIER_nondet_uint(); [L6182] RET, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}, tty_devnum(tty)=18446744073709551644] [L6182] sl->line = tty_devnum(tty) [L6183] CALL, EXPR get_current() VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4839] struct task_struct *pfo_ret__ ; [L4842] case 1UL: [L4845] case 2UL: [L4848] case 4UL: [L4851] case 8UL: VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4858] return (pfo_ret__); VAL [\result={18446744073709551639:-4}, __this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, pfo_ret__={18446744073709551639:-4}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6183] RET, EXPR get_current() VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, get_current()={18446744073709551639:-4}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6183] tmp___1 = get_current() [L6184] EXPR tmp___1->pid [L6184] sl->pid = tmp___1->pid [L6185] CALL, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [\old(nr)=0, __this_module={18446744073709551618:18446744073709551619}, addr={-18446744073709551615:2668}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4722] EXPR addr + (unsigned long )(nr / 64U) [L4722] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6185] RET, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [__this_module={18446744073709551618:18446744073709551619}, constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags))=-7, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tmp___1={18446744073709551639:-4}, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6185] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6186] COND FALSE !(tmp___2 == 0) VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tmp___1={18446744073709551639:-4}, tmp___2=-7, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6200] EXPR sl->keepalive VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl->keepalive=512, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tmp___1={18446744073709551639:-4}, tmp___2=-7, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6200] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6205] EXPR sl->outfill VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl->outfill=768, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tmp___1={18446744073709551639:-4}, tmp___2=-7, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6205] COND FALSE !((unsigned int )sl->outfill != 0U) [L6210] FCALL rtnl_unlock() VAL [__this_module={18446744073709551618:18446744073709551619}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=12, tmp___1={18446744073709551639:-4}, tmp___2=-7, tty={-73786976294838206465:0}, tty={-73786976294838206465:0}] [L6211] tty->receive_room = 65536U [L6212] EXPR sl->dev [L6212] EXPR (sl->dev)->base_addr [L6212] return ((int )(sl->dev)->base_addr); [L7642] RET, EXPR slip_open(tty) [L7642] tmp = slip_open(tty) [L7643] ldv_func_res = tmp [L7644] CALL ldv_check_callback_ret_val(ldv_func_res) [L7658] COND TRUE ret_val > 0 [L7659] CALL ldv_error() [L7652] reach_error() VAL [__this_module={18446744073709551618:18446744073709551619}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-73786976294838206465:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-129127208515966861313:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 54 procedures, 1106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 759.0s, OverallIterations: 24, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.4s, AutomataDifference: 407.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 77903 SdHoareTripleChecker+Valid, 360.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74464 mSDsluCounter, 230325 SdHoareTripleChecker+Invalid, 327.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20783 IncrementalHoareTripleChecker+Unchecked, 194831 mSDsCounter, 33940 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192100 IncrementalHoareTripleChecker+Invalid, 246843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33940 mSolverCounterUnsat, 35494 mSDtfsCounter, 192100 mSolverCounterSat, 2.8s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7318 GetRequests, 6775 SyntacticMatches, 34 SemanticMatches, 509 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7040 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8896occurred in iteration=23, InterpolantAutomatonStates: 349, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 44855 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.9s SsaConstructionTime, 275.0s SatisfiabilityAnalysisTime, 45.3s InterpolantComputationTime, 10015 NumberOfCodeBlocks, 9889 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 11554 ConstructedInterpolants, 50 QuantifiedInterpolants, 27912 SizeOfPredicates, 144 NumberOfNonLiveVariables, 23273 ConjunctsInSsa, 592 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 26544/27359 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-11-18 20:46:53,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro --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 b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:46:56,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:46:56,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:46:56,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:46:56,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:46:56,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:46:56,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:46:56,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:46:56,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:46:56,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:46:56,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:46:56,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:46:56,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:46:56,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:46:56,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:46:56,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:46:56,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:46:56,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:46:56,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:46:56,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:46:56,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:46:56,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:46:56,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:46:56,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:46:56,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:46:56,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:46:56,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:46:56,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:46:56,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:46:56,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:46:56,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:46:56,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:46:56,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:46:56,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:46:56,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:46:56,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:46:56,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:46:56,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:46:56,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:46:56,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:46:56,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:46:56,202 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 20:46:56,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:46:56,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:46:56,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:46:56,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:46:56,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:46:56,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:46:56,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:46:56,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:46:56,241 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:46:56,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:46:56,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:46:56,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:46:56,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:46:56,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:46:56,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:46:56,243 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:46:56,243 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:46:56,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:46:56,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:46:56,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:46:56,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:46:56,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:46:56,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:46:56,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:46:56,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:46:56,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:46:56,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:46:56,246 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:46:56,246 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:46:56,246 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:46:56,246 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:46:56,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:46:56,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:46:56,247 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro 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 -> b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a [2022-11-18 20:46:56,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:46:56,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:46:56,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:46:56,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:46:56,706 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:46:56,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-18 20:46:56,794 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/2421a8aea/4e9aeebd46464f4884902084cbfa0343/FLAGda4516a9c [2022-11-18 20:46:57,824 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:46:57,825 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-18 20:46:57,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/2421a8aea/4e9aeebd46464f4884902084cbfa0343/FLAGda4516a9c [2022-11-18 20:46:58,301 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/data/2421a8aea/4e9aeebd46464f4884902084cbfa0343 [2022-11-18 20:46:58,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:46:58,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:46:58,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:46:58,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:46:58,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:46:58,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:46:58" (1/1) ... [2022-11-18 20:46:58,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a330d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:58, skipping insertion in model container [2022-11-18 20:46:58,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:46:58" (1/1) ... [2022-11-18 20:46:58,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:46:58,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:47:00,298 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-11-18 20:47:00,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:47:00,384 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:47:00,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:47:00,785 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-11-18 20:47:00,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:47:00,830 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:47:01,210 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-11-18 20:47:01,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:47:01,360 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:47:01,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01 WrapperNode [2022-11-18 20:47:01,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:47:01,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:47:01,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:47:01,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:47:01,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,609 INFO L138 Inliner]: procedures = 200, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3091 [2022-11-18 20:47:01,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:47:01,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:47:01,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:47:01,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:47:01,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,818 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:47:01,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:47:01,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:47:01,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:47:01,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:01" (1/1) ... [2022-11-18 20:47:01,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:47:01,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:47:01,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:47:01,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ee536a5-b413-42b1-b185-45975e5d8266/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:47:01,942 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-11-18 20:47:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-11-18 20:47:01,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-18 20:47:01,943 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-11-18 20:47:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-11-18 20:47:01,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-18 20:47:01,944 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-11-18 20:47:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 20:47:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-18 20:47:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-18 20:47:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:47:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:47:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-18 20:47:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-18 20:47:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-11-18 20:47:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-11-18 20:47:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:47:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:47:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-11-18 20:47:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-11-18 20:47:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-18 20:47:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-18 20:47:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:47:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:47:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-18 20:47:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-18 20:47:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-18 20:47:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-18 20:47:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-11-18 20:47:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-11-18 20:47:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-18 20:47:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-18 20:47:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:47:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-11-18 20:47:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-11-18 20:47:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-11-18 20:47:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-11-18 20:47:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:47:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-18 20:47:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-18 20:47:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-11-18 20:47:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-11-18 20:47:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-18 20:47:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-18 20:47:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-18 20:47:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:47:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:47:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-11-18 20:47:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-11-18 20:47:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:47:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-18 20:47:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-18 20:47:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:47:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 20:47:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-11-18 20:47:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-11-18 20:47:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-18 20:47:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-18 20:47:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-18 20:47:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-18 20:47:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-18 20:47:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-18 20:47:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-11-18 20:47:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-11-18 20:47:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-18 20:47:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-18 20:47:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-11-18 20:47:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-11-18 20:47:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-11-18 20:47:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-11-18 20:47:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-18 20:47:01,963 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-18 20:47:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-11-18 20:47:01,963 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-11-18 20:47:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-11-18 20:47:01,963 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-11-18 20:47:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-18 20:47:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-18 20:47:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-18 20:47:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-18 20:47:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 20:47:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 20:47:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-11-18 20:47:01,965 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-11-18 20:47:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-11-18 20:47:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-11-18 20:47:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-18 20:47:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-11-18 20:47:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 20:47:01,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 20:47:01,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-18 20:47:01,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-18 20:47:01,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:47:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-11-18 20:47:01,970 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-11-18 20:47:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-18 20:47:01,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-18 20:47:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-11-18 20:47:01,970 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-11-18 20:47:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:47:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-11-18 20:47:01,971 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-11-18 20:47:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:47:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-18 20:47:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-11-18 20:47:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-11-18 20:47:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-18 20:47:01,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-18 20:47:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-11-18 20:47:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-11-18 20:47:01,973 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-11-18 20:47:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-18 20:47:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-18 20:47:01,977 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2022-11-18 20:47:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2022-11-18 20:47:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-11-18 20:47:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-11-18 20:47:01,979 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-11-18 20:47:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-11-18 20:47:01,981 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-11-18 20:47:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-11-18 20:47:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-11-18 20:47:01,987 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-11-18 20:47:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_ULONG~TO~VOID [2022-11-18 20:47:01,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_ULONG~TO~VOID [2022-11-18 20:47:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-18 20:47:01,988 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-18 20:47:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-11-18 20:47:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-11-18 20:47:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-11-18 20:47:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-18 20:47:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-18 20:47:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:47:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:47:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-18 20:47:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-18 20:47:02,796 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:47:02,800 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation