./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 35322e0b72e8a87732ec03377d34c86d0c1d78e1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-05 17:21:43,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-05 17:21:43,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-05 17:21:43,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-05 17:21:43,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-05 17:21:43,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-05 17:21:43,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-05 17:21:43,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-05 17:21:43,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-05 17:21:43,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-05 17:21:43,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-05 17:21:43,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-05 17:21:43,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-05 17:21:43,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-05 17:21:43,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-05 17:21:43,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-05 17:21:43,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-05 17:21:43,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-05 17:21:43,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-05 17:21:43,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-05 17:21:43,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-05 17:21:43,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-05 17:21:43,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-05 17:21:43,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-05 17:21:43,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-05 17:21:43,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-05 17:21:43,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-05 17:21:43,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-05 17:21:43,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-05 17:21:43,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-05 17:21:43,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-05 17:21:43,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-05 17:21:43,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-05 17:21:43,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-05 17:21:43,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-05 17:21:43,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-05 17:21:43,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-05 17:21:43,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-05 17:21:43,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-05 17:21:43,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-05 17:21:43,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-05 17:21:43,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-07-05 17:21:43,235 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-05 17:21:43,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-05 17:21:43,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-05 17:21:43,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-05 17:21:43,238 INFO L138 SettingsManager]: * Use SBE=true [2021-07-05 17:21:43,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-05 17:21:43,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-05 17:21:43,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-05 17:21:43,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-05 17:21:43,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-05 17:21:43,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-05 17:21:43,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-05 17:21:43,240 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-05 17:21:43,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-05 17:21:43,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-05 17:21:43,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-05 17:21:43,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-05 17:21:43,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 17:21:43,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-05 17:21:43,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-05 17:21:43,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-05 17:21:43,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-05 17:21:43,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-05 17:21:43,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-05 17:21:43,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-05 17:21:43,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35322e0b72e8a87732ec03377d34c86d0c1d78e1 [2021-07-05 17:21:43,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-05 17:21:43,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-05 17:21:43,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-05 17:21:43,549 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-05 17:21:43,549 INFO L275 PluginConnector]: CDTParser initialized [2021-07-05 17:21:43,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-07-05 17:21:43,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa60ec69/b74673da29024d9e9e8be6038980a40a/FLAG5da19ba64 [2021-07-05 17:21:44,248 INFO L306 CDTParser]: Found 1 translation units. [2021-07-05 17:21:44,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-07-05 17:21:44,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa60ec69/b74673da29024d9e9e8be6038980a40a/FLAG5da19ba64 [2021-07-05 17:21:44,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa60ec69/b74673da29024d9e9e8be6038980a40a [2021-07-05 17:21:44,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-05 17:21:44,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-05 17:21:44,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-05 17:21:44,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-05 17:21:44,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-05 17:21:44,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 05:21:44" (1/1) ... [2021-07-05 17:21:44,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9034fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:44, skipping insertion in model container [2021-07-05 17:21:44,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 05:21:44" (1/1) ... [2021-07-05 17:21:44,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-05 17:21:44,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-05 17:21:45,343 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2021-07-05 17:21:45,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 17:21:45,406 INFO L203 MainTranslator]: Completed pre-run [2021-07-05 17:21:45,553 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2021-07-05 17:21:45,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 17:21:45,626 INFO L208 MainTranslator]: Completed translation [2021-07-05 17:21:45,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45 WrapperNode [2021-07-05 17:21:45,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-05 17:21:45,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-05 17:21:45,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-05 17:21:45,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-05 17:21:45,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-05 17:21:45,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-05 17:21:45,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-05 17:21:45,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-05 17:21:45,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-05 17:21:45,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-05 17:21:45,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-05 17:21:45,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-05 17:21:45,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (1/1) ... [2021-07-05 17:21:45,928 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 17:21:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-05 17:21:45,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-07-05 17:21:45,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-07-05 17:21:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-07-05 17:21:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-05 17:21:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-05 17:21:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-07-05 17:21:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-05 17:21:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-07-05 17:21:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-05 17:21:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-05 17:21:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-07-05 17:21:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-05 17:21:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-05 17:21:46,521 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-07-05 17:21:46,525 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-07-05 17:21:46,527 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-07-05 17:21:46,529 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-07-05 17:21:46,551 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-07-05 17:21:50,658 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2021-07-05 17:21:50,659 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2021-07-05 17:21:50,659 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2021-07-05 17:21:50,659 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2021-07-05 17:21:50,659 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##339: assume false; [2021-07-05 17:21:50,659 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume !false; [2021-07-05 17:21:50,660 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2021-07-05 17:21:50,660 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2021-07-05 17:21:50,660 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2021-07-05 17:21:50,660 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2021-07-05 17:21:50,679 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-05 17:21:50,679 INFO L299 CfgBuilder]: Removed 156 assume(true) statements. [2021-07-05 17:21:50,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 05:21:50 BoogieIcfgContainer [2021-07-05 17:21:50,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-05 17:21:50,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-05 17:21:50,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-05 17:21:50,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-05 17:21:50,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.07 05:21:44" (1/3) ... [2021-07-05 17:21:50,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc4b6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 05:21:50, skipping insertion in model container [2021-07-05 17:21:50,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 05:21:45" (2/3) ... [2021-07-05 17:21:50,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc4b6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 05:21:50, skipping insertion in model container [2021-07-05 17:21:50,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 05:21:50" (3/3) ... [2021-07-05 17:21:50,687 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-07-05 17:21:50,692 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-05 17:21:50,692 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-07-05 17:21:50,729 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 17:21:50,734 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 17:21:50,734 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 17:21:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-07-05 17:21:50,768 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:21:50,769 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:21:50,769 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:21:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:21:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash -53973916, now seen corresponding path program 1 times [2021-07-05 17:21:50,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:21:50,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579250854] [2021-07-05 17:21:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:21:50,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:21:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:21:51,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:51,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:51,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:51,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:21:51,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:51,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:21:51,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:21:51,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579250854] [2021-07-05 17:21:51,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579250854] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:21:51,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:21:51,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:21:51,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572091145] [2021-07-05 17:21:51,290 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:21:51,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:21:51,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:21:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:21:51,307 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:21:51,676 INFO L93 Difference]: Finished difference Result 788 states and 1214 transitions. [2021-07-05 17:21:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:21:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-07-05 17:21:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:21:51,720 INFO L225 Difference]: With dead ends: 788 [2021-07-05 17:21:51,721 INFO L226 Difference]: Without dead ends: 482 [2021-07-05 17:21:51,724 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:21:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-07-05 17:21:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 262. [2021-07-05 17:21:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3524904214559388) internal successors, (353), 261 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2021-07-05 17:21:51,781 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 49 [2021-07-05 17:21:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:21:51,782 INFO L442 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2021-07-05 17:21:51,782 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2021-07-05 17:21:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-05 17:21:51,791 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:21:51,791 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:21:51,791 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-05 17:21:51,792 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:21:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:21:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash 752642256, now seen corresponding path program 1 times [2021-07-05 17:21:51,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:21:51,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594466135] [2021-07-05 17:21:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:21:51,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:21:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:21:51,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:51,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:52,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:21:52,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:21:52,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:21:52,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594466135] [2021-07-05 17:21:52,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594466135] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:21:52,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:21:52,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:21:52,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548615955] [2021-07-05 17:21:52,014 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:21:52,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:21:52,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:21:52,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:21:52,016 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:21:52,238 INFO L93 Difference]: Finished difference Result 730 states and 996 transitions. [2021-07-05 17:21:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:21:52,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-07-05 17:21:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:21:52,241 INFO L225 Difference]: With dead ends: 730 [2021-07-05 17:21:52,241 INFO L226 Difference]: Without dead ends: 482 [2021-07-05 17:21:52,243 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:21:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-07-05 17:21:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 480. [2021-07-05 17:21:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.3695198329853862) internal successors, (656), 479 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 656 transitions. [2021-07-05 17:21:52,263 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 656 transitions. Word has length 55 [2021-07-05 17:21:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:21:52,263 INFO L442 AbstractCegarLoop]: Abstraction has 480 states and 656 transitions. [2021-07-05 17:21:52,263 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 656 transitions. [2021-07-05 17:21:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-05 17:21:52,265 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:21:52,265 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:21:52,265 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-05 17:21:52,266 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:21:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:21:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 358275470, now seen corresponding path program 1 times [2021-07-05 17:21:52,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:21:52,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879447277] [2021-07-05 17:21:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:21:52,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:21:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:21:52,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:52,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:52,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:52,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:21:52,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:21:52,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879447277] [2021-07-05 17:21:52,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879447277] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:21:52,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:21:52,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:21:52,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500979534] [2021-07-05 17:21:52,428 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:21:52,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:21:52,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:21:52,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:21:52,429 INFO L87 Difference]: Start difference. First operand 480 states and 656 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:21:52,566 INFO L93 Difference]: Finished difference Result 1648 states and 2263 transitions. [2021-07-05 17:21:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:21:52,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-07-05 17:21:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:21:52,571 INFO L225 Difference]: With dead ends: 1648 [2021-07-05 17:21:52,571 INFO L226 Difference]: Without dead ends: 1182 [2021-07-05 17:21:52,572 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:21:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2021-07-05 17:21:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 484. [2021-07-05 17:21:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3664596273291925) internal successors, (660), 483 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 660 transitions. [2021-07-05 17:21:52,596 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 660 transitions. Word has length 55 [2021-07-05 17:21:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:21:52,597 INFO L442 AbstractCegarLoop]: Abstraction has 484 states and 660 transitions. [2021-07-05 17:21:52,597 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 660 transitions. [2021-07-05 17:21:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-05 17:21:52,600 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:21:52,600 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:21:52,600 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-05 17:21:52,600 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:21:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:21:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1230072432, now seen corresponding path program 1 times [2021-07-05 17:21:52,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:21:52,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089630687] [2021-07-05 17:21:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:21:52,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:21:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:21:52,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:52,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:52,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:52,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:52,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:52,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:21:52,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:21:52,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089630687] [2021-07-05 17:21:52,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089630687] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:21:52,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:21:52,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 17:21:52,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337911464] [2021-07-05 17:21:52,777 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 17:21:52,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:21:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 17:21:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:21:52,778 INFO L87 Difference]: Start difference. First operand 484 states and 660 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:21:53,020 INFO L93 Difference]: Finished difference Result 3076 states and 4222 transitions. [2021-07-05 17:21:53,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 17:21:53,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-07-05 17:21:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:21:53,032 INFO L225 Difference]: With dead ends: 3076 [2021-07-05 17:21:53,032 INFO L226 Difference]: Without dead ends: 2606 [2021-07-05 17:21:53,033 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-07-05 17:21:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2021-07-05 17:21:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 490. [2021-07-05 17:21:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.361963190184049) internal successors, (666), 489 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 666 transitions. [2021-07-05 17:21:53,073 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 666 transitions. Word has length 55 [2021-07-05 17:21:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:21:53,073 INFO L442 AbstractCegarLoop]: Abstraction has 490 states and 666 transitions. [2021-07-05 17:21:53,073 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 666 transitions. [2021-07-05 17:21:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-05 17:21:53,075 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:21:53,075 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:21:53,075 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-05 17:21:53,076 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:21:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:21:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2047720882, now seen corresponding path program 1 times [2021-07-05 17:21:53,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:21:53,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815923236] [2021-07-05 17:21:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:21:53,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:21:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:21:53,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:53,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:53,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:53,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:53,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:21:53,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:21:53,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:21:53,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815923236] [2021-07-05 17:21:53,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815923236] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:21:53,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:21:53,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 17:21:53,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901774312] [2021-07-05 17:21:53,257 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 17:21:53,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:21:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 17:21:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 17:21:53,258 INFO L87 Difference]: Start difference. First operand 490 states and 666 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:21:53,671 INFO L93 Difference]: Finished difference Result 2399 states and 3259 transitions. [2021-07-05 17:21:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-05 17:21:53,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-07-05 17:21:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:21:53,680 INFO L225 Difference]: With dead ends: 2399 [2021-07-05 17:21:53,681 INFO L226 Difference]: Without dead ends: 2146 [2021-07-05 17:21:53,683 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 138.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-07-05 17:21:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2021-07-05 17:21:53,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 498. [2021-07-05 17:21:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.3561368209255533) internal successors, (674), 497 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 674 transitions. [2021-07-05 17:21:53,741 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 674 transitions. Word has length 55 [2021-07-05 17:21:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:21:53,742 INFO L442 AbstractCegarLoop]: Abstraction has 498 states and 674 transitions. [2021-07-05 17:21:53,742 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 674 transitions. [2021-07-05 17:21:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-05 17:21:53,743 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:21:53,743 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:21:53,743 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-05 17:21:53,743 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:21:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:21:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1236129164, now seen corresponding path program 1 times [2021-07-05 17:21:53,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:21:53,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587304492] [2021-07-05 17:21:53,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:21:53,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:21:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:21:53,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:21:53,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:21:53,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:53,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:21:53,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:21:53,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587304492] [2021-07-05 17:21:53,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587304492] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:21:53,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:21:53,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:21:53,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642284110] [2021-07-05 17:21:53,881 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:21:53,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:21:53,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:21:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:21:53,882 INFO L87 Difference]: Start difference. First operand 498 states and 674 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:21:56,044 INFO L93 Difference]: Finished difference Result 1417 states and 1931 transitions. [2021-07-05 17:21:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:21:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-07-05 17:21:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:21:56,050 INFO L225 Difference]: With dead ends: 1417 [2021-07-05 17:21:56,050 INFO L226 Difference]: Without dead ends: 1415 [2021-07-05 17:21:56,051 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:21:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2021-07-05 17:21:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 975. [2021-07-05 17:21:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.3603696098562628) internal successors, (1325), 974 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1325 transitions. [2021-07-05 17:21:56,107 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1325 transitions. Word has length 55 [2021-07-05 17:21:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:21:56,107 INFO L442 AbstractCegarLoop]: Abstraction has 975 states and 1325 transitions. [2021-07-05 17:21:56,107 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1325 transitions. [2021-07-05 17:21:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-07-05 17:21:56,110 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:21:56,111 INFO L525 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-07-05 17:21:56,111 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-05 17:21:56,111 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:21:56,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:21:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -812353158, now seen corresponding path program 1 times [2021-07-05 17:21:56,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:21:56,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364762801] [2021-07-05 17:21:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:21:56,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:21:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:21:56,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:56,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:56,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:56,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:21:56,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:56,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:21:56,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:56,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:21:56,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:21:56,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:21:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:21:56,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:21:56,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364762801] [2021-07-05 17:21:56,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364762801] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:21:56,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:21:56,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:21:56,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921401865] [2021-07-05 17:21:56,380 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:21:56,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:21:56,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:21:56,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:21:56,381 INFO L87 Difference]: Start difference. First operand 975 states and 1325 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:21:58,571 INFO L93 Difference]: Finished difference Result 1415 states and 1929 transitions. [2021-07-05 17:21:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:21:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-07-05 17:21:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:21:58,572 INFO L225 Difference]: With dead ends: 1415 [2021-07-05 17:21:58,572 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 17:21:58,574 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:21:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 17:21:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 17:21:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 17:21:58,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2021-07-05 17:21:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:21:58,575 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 17:21:58,575 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:21:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 17:21:58,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 17:21:58,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 17:21:58,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:58,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:21:59,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:00,738 INFO L762 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-07-05 17:22:00,738 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,738 INFO L758 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,739 INFO L758 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,739 INFO L762 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-07-05 17:22:00,739 INFO L758 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,739 INFO L762 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-07-05 17:22:00,739 INFO L762 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,739 INFO L758 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,739 INFO L762 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,740 INFO L762 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-07-05 17:22:00,740 INFO L758 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,740 INFO L758 garLoopResultBuilder]: At program point L4069-1(lines 4068 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,740 INFO L758 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,740 INFO L762 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-07-05 17:22:00,740 INFO L758 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,740 INFO L762 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-07-05 17:22:00,740 INFO L762 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,741 INFO L762 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,742 INFO L758 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,742 INFO L758 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,742 INFO L758 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,742 INFO L762 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-07-05 17:22:00,742 INFO L762 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-07-05 17:22:00,742 INFO L758 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,742 INFO L762 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-07-05 17:22:00,743 INFO L762 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,743 INFO L758 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,743 INFO L762 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,743 INFO L762 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-07-05 17:22:00,743 INFO L758 garLoopResultBuilder]: At program point L4075-1(lines 4071 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,743 INFO L758 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,743 INFO L765 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: true [2021-07-05 17:22:00,743 INFO L762 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-07-05 17:22:00,744 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,744 INFO L758 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,744 INFO L762 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-07-05 17:22:00,744 INFO L758 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,745 INFO L762 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-07-05 17:22:00,746 INFO L762 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,746 INFO L762 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,746 INFO L758 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,746 INFO L762 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,746 INFO L758 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:00,747 INFO L758 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,747 INFO L758 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,747 INFO L758 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,747 INFO L762 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,747 INFO L762 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-07-05 17:22:00,747 INFO L762 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,747 INFO L762 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-07-05 17:22:00,747 INFO L758 garLoopResultBuilder]: At program point L4081-1(lines 4077 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,748 INFO L758 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,748 INFO L762 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-07-05 17:22:00,748 INFO L762 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-07-05 17:22:00,748 INFO L762 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-07-05 17:22:00,748 INFO L758 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,749 INFO L762 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,749 INFO L762 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-07-05 17:22:00,749 INFO L758 garLoopResultBuilder]: At program point L5139(lines 1 5156) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:00,749 INFO L765 garLoopResultBuilder]: At program point L5139-1(lines 5047 5052) the Hoare annotation is: true [2021-07-05 17:22:00,749 INFO L762 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:00,749 INFO L762 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:00,750 INFO L762 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-07-05 17:22:00,750 INFO L758 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,750 INFO L762 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:00,750 INFO L762 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,750 INFO L762 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,750 INFO L762 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:00,750 INFO L762 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:00,750 INFO L762 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L5075(lines 5072 5076) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L5075-1(lines 5072 5076) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L4084-1(lines 4083 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (or (and (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (<= 0 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)) (<= 1 ~ldv_urb_state~0)) [2021-07-05 17:22:00,751 INFO L758 garLoopResultBuilder]: At program point L5075-2(lines 5072 5076) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,752 INFO L758 garLoopResultBuilder]: At program point L5075-3(lines 5072 5076) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,752 INFO L758 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,752 INFO L758 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,752 INFO L762 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,752 INFO L758 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,752 INFO L758 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,752 INFO L758 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,753 INFO L758 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,753 INFO L762 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-07-05 17:22:00,753 INFO L762 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,753 INFO L762 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,753 INFO L758 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,753 INFO L762 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:00,753 INFO L762 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:00,753 INFO L758 garLoopResultBuilder]: At program point L5078(lines 5077 5079) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,754 INFO L762 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-07-05 17:22:00,754 INFO L758 garLoopResultBuilder]: At program point L4087-1(lines 4086 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,754 INFO L758 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,754 INFO L758 garLoopResultBuilder]: At program point L5078-1(lines 5077 5079) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,754 INFO L762 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-07-05 17:22:00,754 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 17:22:00,754 INFO L762 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:00,754 INFO L762 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,755 INFO L762 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:00,755 INFO L762 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-07-05 17:22:00,755 INFO L762 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:00,755 INFO L762 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:00,755 INFO L758 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,755 INFO L762 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,755 INFO L762 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,755 INFO L762 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,756 INFO L758 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:00,756 INFO L758 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,756 INFO L758 garLoopResultBuilder]: At program point L4090-1(lines 4089 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,756 INFO L762 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-07-05 17:22:00,756 INFO L762 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-07-05 17:22:00,756 INFO L758 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,756 INFO L762 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,756 INFO L758 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,757 INFO L758 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,757 INFO L762 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-07-05 17:22:00,757 INFO L758 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,757 INFO L758 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:00,757 INFO L758 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,757 INFO L758 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,757 INFO L762 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,758 INFO L762 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:00,758 INFO L758 garLoopResultBuilder]: At program point L5017-2loopEntry(lines 5017 5036) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,758 INFO L758 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,759 INFO L762 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-07-05 17:22:00,759 INFO L762 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,759 INFO L762 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:00,759 INFO L762 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:00,759 INFO L762 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:00,759 INFO L758 garLoopResultBuilder]: At program point L4093-1(lines 4092 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,759 INFO L758 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,759 INFO L762 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:00,760 INFO L762 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:00,760 INFO L762 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:00,760 INFO L758 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,760 INFO L762 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,761 INFO L758 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,761 INFO L762 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:00,761 INFO L762 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:00,761 INFO L758 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,761 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 17:22:00,762 INFO L758 garLoopResultBuilder]: At program point L4095-1(lines 4094 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,762 INFO L758 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,763 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,763 INFO L762 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,763 INFO L758 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,763 INFO L762 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-07-05 17:22:00,763 INFO L762 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-07-05 17:22:00,763 INFO L758 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,763 INFO L762 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-07-05 17:22:00,763 INFO L758 garLoopResultBuilder]: At program point L5154(lines 1 5156) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,764 INFO L762 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,764 INFO L762 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:00,764 INFO L762 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:00,764 INFO L762 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-07-05 17:22:00,764 INFO L758 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,764 INFO L762 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-07-05 17:22:00,764 INFO L758 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,764 INFO L762 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-07-05 17:22:00,764 INFO L762 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:00,765 INFO L762 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:00,765 INFO L758 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,765 INFO L758 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,765 INFO L762 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,765 INFO L758 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,765 INFO L762 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-07-05 17:22:00,766 INFO L758 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,766 INFO L762 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-07-05 17:22:00,766 INFO L758 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,766 INFO L762 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:00,766 INFO L758 garLoopResultBuilder]: At program point L5092(lines 4860 4863) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,766 INFO L762 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-07-05 17:22:00,766 INFO L762 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:00,766 INFO L762 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:00,766 INFO L762 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,766 INFO L765 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: true [2021-07-05 17:22:00,766 INFO L762 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L758 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L758 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L758 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L758 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:00,767 INFO L762 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,767 INFO L758 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L5098(lines 5097 5099) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L758 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,768 INFO L762 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L765 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L3651-1(lines 3644 3653) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L3651(lines 3644 3653) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4909-2(lines 5053 5058) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L765 garLoopResultBuilder]: At program point L4909-3(lines 5044 5061) the Hoare annotation is: true [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4909(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L762 garLoopResultBuilder]: For program point L4909-1(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L4645(lines 4614 4647) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:00,769 INFO L758 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,770 INFO L758 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L758 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:00,770 INFO L758 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,770 INFO L758 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,770 INFO L758 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,770 INFO L762 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-07-05 17:22:00,771 INFO L758 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,771 INFO L758 garLoopResultBuilder]: At program point L4122-1(lines 4096 4123) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,771 INFO L762 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-07-05 17:22:00,771 INFO L758 garLoopResultBuilder]: At program point L3726(lines 3723 3728) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:00,771 INFO L758 garLoopResultBuilder]: At program point L3726-1(lines 3723 3728) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,771 INFO L762 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:00,771 INFO L762 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:00,771 INFO L758 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,772 INFO L758 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,772 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 17:22:00,772 INFO L758 garLoopResultBuilder]: At program point L4125-1(lines 4065 4127) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,772 INFO L758 garLoopResultBuilder]: At program point L4125(lines 4065 4127) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,772 INFO L758 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,772 INFO L762 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:00,772 INFO L762 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:00,772 INFO L762 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-07-05 17:22:00,773 INFO L762 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-07-05 17:22:00,773 INFO L762 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-07-05 17:22:00,773 INFO L758 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,773 INFO L762 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:00,773 INFO L762 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:00,773 INFO L758 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,773 INFO L765 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:00,773 INFO L765 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:00,774 INFO L758 garLoopResultBuilder]: At program point L3732(lines 3729 3734) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,774 INFO L758 garLoopResultBuilder]: At program point L3732-1(lines 3729 3734) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,774 INFO L758 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,774 INFO L762 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-07-05 17:22:00,774 INFO L762 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-07-05 17:22:00,774 INFO L758 garLoopResultBuilder]: At program point L5122(lines 5121 5123) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:00,775 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-05 17:22:00,775 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 17:22:00,778 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/4) [2021-07-05 17:22:00,781 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 17:22:00,782 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 17:22:00,782 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 17:22:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-07-05 17:22:00,786 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:00,786 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:00,786 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1230376075, now seen corresponding path program 1 times [2021-07-05 17:22:00,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:00,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526923544] [2021-07-05 17:22:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:00,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:00,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:00,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:00,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:00,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:00,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:00,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:00,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:00,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526923544] [2021-07-05 17:22:00,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526923544] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:00,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:00,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:00,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168012514] [2021-07-05 17:22:00,879 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:00,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:00,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:00,880 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:01,161 INFO L93 Difference]: Finished difference Result 788 states and 1214 transitions. [2021-07-05 17:22:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:01,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-07-05 17:22:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:01,164 INFO L225 Difference]: With dead ends: 788 [2021-07-05 17:22:01,164 INFO L226 Difference]: Without dead ends: 484 [2021-07-05 17:22:01,165 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-07-05 17:22:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 262. [2021-07-05 17:22:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3524904214559388) internal successors, (353), 261 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2021-07-05 17:22:01,171 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 46 [2021-07-05 17:22:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:01,171 INFO L442 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2021-07-05 17:22:01,171 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2021-07-05 17:22:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 17:22:01,172 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:01,172 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:01,172 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-07-05 17:22:01,172 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:01,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1410412169, now seen corresponding path program 1 times [2021-07-05 17:22:01,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:01,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624304545] [2021-07-05 17:22:01,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:01,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:01,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:01,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:01,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:01,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:01,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624304545] [2021-07-05 17:22:01,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624304545] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:01,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:01,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:01,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168217043] [2021-07-05 17:22:01,271 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:01,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:01,272 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:01,506 INFO L93 Difference]: Finished difference Result 732 states and 998 transitions. [2021-07-05 17:22:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 17:22:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:01,509 INFO L225 Difference]: With dead ends: 732 [2021-07-05 17:22:01,509 INFO L226 Difference]: Without dead ends: 484 [2021-07-05 17:22:01,510 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-07-05 17:22:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 480. [2021-07-05 17:22:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.37160751565762) internal successors, (657), 479 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 657 transitions. [2021-07-05 17:22:01,523 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 657 transitions. Word has length 52 [2021-07-05 17:22:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:01,523 INFO L442 AbstractCegarLoop]: Abstraction has 480 states and 657 transitions. [2021-07-05 17:22:01,523 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 657 transitions. [2021-07-05 17:22:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 17:22:01,529 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:01,529 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:01,529 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-07-05 17:22:01,530 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:01,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1338025611, now seen corresponding path program 1 times [2021-07-05 17:22:01,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:01,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335463456] [2021-07-05 17:22:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:01,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:01,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:01,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:01,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:01,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:01,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:01,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335463456] [2021-07-05 17:22:01,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335463456] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:01,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:01,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:22:01,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056378237] [2021-07-05 17:22:01,658 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:01,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:01,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:01,658 INFO L87 Difference]: Start difference. First operand 480 states and 657 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:01,757 INFO L93 Difference]: Finished difference Result 1648 states and 2265 transitions. [2021-07-05 17:22:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:22:01,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 17:22:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:01,762 INFO L225 Difference]: With dead ends: 1648 [2021-07-05 17:22:01,762 INFO L226 Difference]: Without dead ends: 1182 [2021-07-05 17:22:01,763 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2021-07-05 17:22:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 484. [2021-07-05 17:22:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3685300207039337) internal successors, (661), 483 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 661 transitions. [2021-07-05 17:22:01,780 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 661 transitions. Word has length 52 [2021-07-05 17:22:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:01,781 INFO L442 AbstractCegarLoop]: Abstraction has 484 states and 661 transitions. [2021-07-05 17:22:01,781 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 661 transitions. [2021-07-05 17:22:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 17:22:01,782 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:01,783 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:01,783 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-07-05 17:22:01,783 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash 326908361, now seen corresponding path program 1 times [2021-07-05 17:22:01,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:01,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283658949] [2021-07-05 17:22:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:01,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:01,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:01,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:01,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:01,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:01,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:01,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:01,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:01,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283658949] [2021-07-05 17:22:01,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283658949] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:01,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:01,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 17:22:01,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344481800] [2021-07-05 17:22:01,911 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 17:22:01,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 17:22:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:01,912 INFO L87 Difference]: Start difference. First operand 484 states and 661 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:02,103 INFO L93 Difference]: Finished difference Result 3076 states and 4225 transitions. [2021-07-05 17:22:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 17:22:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 17:22:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:02,113 INFO L225 Difference]: With dead ends: 3076 [2021-07-05 17:22:02,113 INFO L226 Difference]: Without dead ends: 2606 [2021-07-05 17:22:02,115 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-07-05 17:22:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2021-07-05 17:22:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 490. [2021-07-05 17:22:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 667 transitions. [2021-07-05 17:22:02,147 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 667 transitions. Word has length 52 [2021-07-05 17:22:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:02,148 INFO L442 AbstractCegarLoop]: Abstraction has 490 states and 667 transitions. [2021-07-05 17:22:02,148 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 667 transitions. [2021-07-05 17:22:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 17:22:02,149 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:02,149 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:02,149 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-07-05 17:22:02,149 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1261439541, now seen corresponding path program 1 times [2021-07-05 17:22:02,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:02,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136730337] [2021-07-05 17:22:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:02,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:02,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:02,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:02,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:02,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:02,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:02,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:02,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:02,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136730337] [2021-07-05 17:22:02,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136730337] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:02,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:02,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:02,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463438053] [2021-07-05 17:22:02,273 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:02,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:02,283 INFO L87 Difference]: Start difference. First operand 490 states and 667 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:04,412 INFO L93 Difference]: Finished difference Result 1401 states and 1917 transitions. [2021-07-05 17:22:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 17:22:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:04,417 INFO L225 Difference]: With dead ends: 1401 [2021-07-05 17:22:04,418 INFO L226 Difference]: Without dead ends: 1399 [2021-07-05 17:22:04,418 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2021-07-05 17:22:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 960. [2021-07-05 17:22:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.3670490093847758) internal successors, (1311), 959 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1311 transitions. [2021-07-05 17:22:04,458 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1311 transitions. Word has length 52 [2021-07-05 17:22:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:04,459 INFO L442 AbstractCegarLoop]: Abstraction has 960 states and 1311 transitions. [2021-07-05 17:22:04,459 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1311 transitions. [2021-07-05 17:22:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-07-05 17:22:04,461 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:04,461 INFO L525 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-07-05 17:22:04,462 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-07-05 17:22:04,462 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1783072925, now seen corresponding path program 1 times [2021-07-05 17:22:04,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:04,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768477959] [2021-07-05 17:22:04,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:04,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:04,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:04,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:04,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:04,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:04,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:04,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:04,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:04,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:04,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:04,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:04,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:04,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768477959] [2021-07-05 17:22:04,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768477959] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:04,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:04,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:22:04,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431470232] [2021-07-05 17:22:04,607 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:04,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:04,608 INFO L87 Difference]: Start difference. First operand 960 states and 1311 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:06,787 INFO L93 Difference]: Finished difference Result 1399 states and 1914 transitions. [2021-07-05 17:22:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:06,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-07-05 17:22:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:06,788 INFO L225 Difference]: With dead ends: 1399 [2021-07-05 17:22:06,788 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 17:22:06,790 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 17:22:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 17:22:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 17:22:06,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2021-07-05 17:22:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:06,791 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 17:22:06,792 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 17:22:06,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 17:22:06,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 17:22:06,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:06,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:07,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:08,153 INFO L762 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-07-05 17:22:08,154 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,154 INFO L758 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,154 INFO L758 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,154 INFO L762 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-07-05 17:22:08,154 INFO L758 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,154 INFO L762 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-07-05 17:22:08,154 INFO L762 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,154 INFO L758 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,154 INFO L762 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,154 INFO L762 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-07-05 17:22:08,154 INFO L758 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,155 INFO L758 garLoopResultBuilder]: At program point L4069-1(lines 4068 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,155 INFO L758 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,155 INFO L762 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-07-05 17:22:08,155 INFO L758 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,155 INFO L762 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-07-05 17:22:08,155 INFO L762 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,155 INFO L762 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,155 INFO L758 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,155 INFO L758 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,155 INFO L758 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,155 INFO L762 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-07-05 17:22:08,155 INFO L762 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-07-05 17:22:08,156 INFO L758 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,156 INFO L762 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-07-05 17:22:08,156 INFO L762 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,156 INFO L758 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,156 INFO L762 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,156 INFO L762 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-07-05 17:22:08,156 INFO L758 garLoopResultBuilder]: At program point L4075-1(lines 4071 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,156 INFO L758 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,156 INFO L765 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: true [2021-07-05 17:22:08,156 INFO L762 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-07-05 17:22:08,156 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,156 INFO L758 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,156 INFO L762 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-07-05 17:22:08,157 INFO L758 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,157 INFO L762 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-07-05 17:22:08,157 INFO L762 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,157 INFO L762 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,157 INFO L758 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,157 INFO L762 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,157 INFO L758 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:08,157 INFO L758 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,157 INFO L758 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,157 INFO L758 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,157 INFO L762 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,157 INFO L762 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L762 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L762 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L758 garLoopResultBuilder]: At program point L4081-1(lines 4077 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,158 INFO L758 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,158 INFO L762 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L762 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L762 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L758 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,158 INFO L762 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L762 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-07-05 17:22:08,158 INFO L758 garLoopResultBuilder]: At program point L5139(lines 1 5156) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:08,158 INFO L765 garLoopResultBuilder]: At program point L5139-1(lines 5047 5052) the Hoare annotation is: true [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L758 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L762 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:08,159 INFO L758 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,159 INFO L758 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,159 INFO L758 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L5075(lines 5072 5076) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L5075-1(lines 5072 5076) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L4084-1(lines 4083 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (or (and (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (<= 0 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)) (<= 1 ~ldv_urb_state~0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L5075-2(lines 5072 5076) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L5075-3(lines 5072 5076) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L762 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,160 INFO L758 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,161 INFO L758 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,161 INFO L762 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-07-05 17:22:08,161 INFO L762 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,161 INFO L762 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,161 INFO L758 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,161 INFO L762 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:08,161 INFO L762 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:08,161 INFO L758 garLoopResultBuilder]: At program point L5078(lines 5077 5079) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,161 INFO L762 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-07-05 17:22:08,161 INFO L758 garLoopResultBuilder]: At program point L4087-1(lines 4086 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,161 INFO L758 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,161 INFO L758 garLoopResultBuilder]: At program point L5078-1(lines 5077 5079) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,161 INFO L762 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-07-05 17:22:08,162 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 17:22:08,162 INFO L762 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:08,165 INFO L762 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,165 INFO L762 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:08,166 INFO L762 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-07-05 17:22:08,166 INFO L762 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:08,166 INFO L762 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:08,166 INFO L758 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,166 INFO L762 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,166 INFO L762 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,166 INFO L762 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,166 INFO L758 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:08,166 INFO L758 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,166 INFO L758 garLoopResultBuilder]: At program point L4090-1(lines 4089 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,166 INFO L762 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-07-05 17:22:08,167 INFO L762 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-07-05 17:22:08,167 INFO L758 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,167 INFO L762 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,167 INFO L758 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,167 INFO L758 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,167 INFO L762 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-07-05 17:22:08,167 INFO L758 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,167 INFO L758 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:08,167 INFO L758 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,168 INFO L758 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:08,168 INFO L758 garLoopResultBuilder]: At program point L5017-2loopEntry(lines 5017 5036) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,168 INFO L758 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:08,168 INFO L758 garLoopResultBuilder]: At program point L4093-1(lines 4092 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,168 INFO L758 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,168 INFO L762 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:08,169 INFO L762 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:08,169 INFO L762 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:08,169 INFO L758 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,169 INFO L762 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,169 INFO L758 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,169 INFO L762 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:08,169 INFO L762 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:08,169 INFO L758 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,169 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 17:22:08,169 INFO L758 garLoopResultBuilder]: At program point L4095-1(lines 4094 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,169 INFO L758 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L758 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L758 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L758 garLoopResultBuilder]: At program point L5154(lines 1 5156) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:08,170 INFO L762 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-07-05 17:22:08,171 INFO L758 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,171 INFO L762 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-07-05 17:22:08,171 INFO L758 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,171 INFO L762 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-07-05 17:22:08,171 INFO L762 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:08,171 INFO L762 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:08,171 INFO L758 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,171 INFO L758 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,171 INFO L762 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,171 INFO L758 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,171 INFO L762 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-07-05 17:22:08,171 INFO L758 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,171 INFO L762 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L758 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L758 garLoopResultBuilder]: At program point L5092(lines 4860 4863) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L765 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: true [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L758 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L762 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:08,172 INFO L758 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L758 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L758 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L758 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L758 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,173 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,173 INFO L758 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,174 INFO L758 garLoopResultBuilder]: At program point L5098(lines 5097 5099) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,174 INFO L758 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,174 INFO L762 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,174 INFO L762 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:08,174 INFO L762 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:08,174 INFO L758 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,174 INFO L762 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-07-05 17:22:08,174 INFO L762 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,174 INFO L758 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,174 INFO L758 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,174 INFO L762 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-07-05 17:22:08,174 INFO L762 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-07-05 17:22:08,175 INFO L758 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,175 INFO L758 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,175 INFO L762 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-07-05 17:22:08,175 INFO L758 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,175 INFO L762 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:08,175 INFO L762 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:08,175 INFO L765 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-07-05 17:22:08,175 INFO L762 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-07-05 17:22:08,175 INFO L758 garLoopResultBuilder]: At program point L3651-1(lines 3644 3653) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,175 INFO L758 garLoopResultBuilder]: At program point L3651(lines 3644 3653) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,175 INFO L762 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-07-05 17:22:08,175 INFO L758 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,175 INFO L758 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,176 INFO L758 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,176 INFO L758 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,176 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 17:22:08,176 INFO L762 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-07-05 17:22:08,176 INFO L762 garLoopResultBuilder]: For program point L4909-2(lines 5053 5058) no Hoare annotation was computed. [2021-07-05 17:22:08,176 INFO L765 garLoopResultBuilder]: At program point L4909-3(lines 5044 5061) the Hoare annotation is: true [2021-07-05 17:22:08,176 INFO L762 garLoopResultBuilder]: For program point L4909(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:08,176 INFO L762 garLoopResultBuilder]: For program point L4909-1(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:08,176 INFO L758 garLoopResultBuilder]: At program point L4645(lines 4614 4647) the Hoare annotation is: (and (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:08,176 INFO L758 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,176 INFO L758 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,176 INFO L762 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L758 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L762 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:08,177 INFO L758 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,177 INFO L758 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,177 INFO L758 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,178 INFO L762 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L4122-1(lines 4096 4123) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,178 INFO L762 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L3726(lines 3723 3728) the Hoare annotation is: (<= 1 ~ldv_urb_state~0) [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L3726-1(lines 3723 3728) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,178 INFO L762 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:08,178 INFO L762 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,178 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L4125-1(lines 4065 4127) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,178 INFO L758 garLoopResultBuilder]: At program point L4125(lines 4065 4127) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,179 INFO L758 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,179 INFO L762 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:08,179 INFO L762 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:08,179 INFO L762 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-07-05 17:22:08,179 INFO L762 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-07-05 17:22:08,179 INFO L762 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-07-05 17:22:08,179 INFO L758 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,179 INFO L762 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:08,179 INFO L762 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:08,179 INFO L758 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,179 INFO L765 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:08,179 INFO L765 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:08,179 INFO L758 garLoopResultBuilder]: At program point L3732(lines 3729 3734) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,180 INFO L758 garLoopResultBuilder]: At program point L3732-1(lines 3729 3734) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,180 INFO L758 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,180 INFO L762 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-07-05 17:22:08,180 INFO L762 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-07-05 17:22:08,180 INFO L758 garLoopResultBuilder]: At program point L5122(lines 5121 5123) the Hoare annotation is: (or (<= 1 ~ldv_urb_state~0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:08,181 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-07-05 17:22:08,181 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 17:22:08,181 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/4) [2021-07-05 17:22:08,184 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 17:22:08,185 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 17:22:08,185 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 17:22:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-07-05 17:22:08,188 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:08,188 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:08,188 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:08,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:08,188 INFO L82 PathProgramCache]: Analyzing trace with hash 986721885, now seen corresponding path program 1 times [2021-07-05 17:22:08,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:08,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553100944] [2021-07-05 17:22:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:08,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:08,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:08,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:08,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:08,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:08,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553100944] [2021-07-05 17:22:08,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553100944] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:08,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:08,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:08,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315537912] [2021-07-05 17:22:08,291 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:08,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:08,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:08,292 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:08,544 INFO L93 Difference]: Finished difference Result 788 states and 1214 transitions. [2021-07-05 17:22:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:08,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-07-05 17:22:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:08,546 INFO L225 Difference]: With dead ends: 788 [2021-07-05 17:22:08,546 INFO L226 Difference]: Without dead ends: 490 [2021-07-05 17:22:08,547 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:08,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-07-05 17:22:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 265. [2021-07-05 17:22:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.356060606060606) internal successors, (358), 264 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 358 transitions. [2021-07-05 17:22:08,553 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 358 transitions. Word has length 12 [2021-07-05 17:22:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:08,553 INFO L442 AbstractCegarLoop]: Abstraction has 265 states and 358 transitions. [2021-07-05 17:22:08,553 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 358 transitions. [2021-07-05 17:22:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-07-05 17:22:08,553 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:08,553 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:08,554 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-07-05 17:22:08,554 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:08,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1666780255, now seen corresponding path program 1 times [2021-07-05 17:22:08,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:08,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886157164] [2021-07-05 17:22:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:08,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:08,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:08,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:08,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:08,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886157164] [2021-07-05 17:22:08,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886157164] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:08,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:08,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 17:22:08,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058001684] [2021-07-05 17:22:08,643 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 17:22:08,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 17:22:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 17:22:08,644 INFO L87 Difference]: Start difference. First operand 265 states and 358 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:08,663 INFO L93 Difference]: Finished difference Result 763 states and 1037 transitions. [2021-07-05 17:22:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 17:22:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-07-05 17:22:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:08,666 INFO L225 Difference]: With dead ends: 763 [2021-07-05 17:22:08,666 INFO L226 Difference]: Without dead ends: 507 [2021-07-05 17:22:08,668 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 17:22:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-07-05 17:22:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2021-07-05 17:22:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.3557312252964426) internal successors, (686), 506 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 686 transitions. [2021-07-05 17:22:08,678 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 686 transitions. Word has length 12 [2021-07-05 17:22:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:08,678 INFO L442 AbstractCegarLoop]: Abstraction has 507 states and 686 transitions. [2021-07-05 17:22:08,678 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 686 transitions. [2021-07-05 17:22:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-07-05 17:22:08,679 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:08,679 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:08,679 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-07-05 17:22:08,679 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1133933506, now seen corresponding path program 1 times [2021-07-05 17:22:08,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:08,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837139430] [2021-07-05 17:22:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:08,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:08,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:08,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:08,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:08,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:08,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:08,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837139430] [2021-07-05 17:22:08,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837139430] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:08,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:08,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:08,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696390676] [2021-07-05 17:22:08,780 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:08,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:08,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:08,781 INFO L87 Difference]: Start difference. First operand 507 states and 686 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:09,026 INFO L93 Difference]: Finished difference Result 1443 states and 1971 transitions. [2021-07-05 17:22:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:09,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-07-05 17:22:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:09,029 INFO L225 Difference]: With dead ends: 1443 [2021-07-05 17:22:09,029 INFO L226 Difference]: Without dead ends: 950 [2021-07-05 17:22:09,031 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2021-07-05 17:22:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 941. [2021-07-05 17:22:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 940 states have (on average 1.373404255319149) internal successors, (1291), 940 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1291 transitions. [2021-07-05 17:22:09,070 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1291 transitions. Word has length 49 [2021-07-05 17:22:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:09,070 INFO L442 AbstractCegarLoop]: Abstraction has 941 states and 1291 transitions. [2021-07-05 17:22:09,070 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1291 transitions. [2021-07-05 17:22:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-07-05 17:22:09,071 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:09,072 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:09,072 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-07-05 17:22:09,072 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1156565760, now seen corresponding path program 1 times [2021-07-05 17:22:09,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:09,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401386424] [2021-07-05 17:22:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:09,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:09,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:09,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:09,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:09,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:09,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:09,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:09,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401386424] [2021-07-05 17:22:09,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401386424] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:09,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:09,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 17:22:09,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810465368] [2021-07-05 17:22:09,194 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 17:22:09,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 17:22:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:09,195 INFO L87 Difference]: Start difference. First operand 941 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:09,422 INFO L93 Difference]: Finished difference Result 5847 states and 8020 transitions. [2021-07-05 17:22:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 17:22:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-07-05 17:22:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:09,441 INFO L225 Difference]: With dead ends: 5847 [2021-07-05 17:22:09,441 INFO L226 Difference]: Without dead ends: 5378 [2021-07-05 17:22:09,444 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-07-05 17:22:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2021-07-05 17:22:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 953. [2021-07-05 17:22:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 1.3686974789915967) internal successors, (1303), 952 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1303 transitions. [2021-07-05 17:22:09,514 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1303 transitions. Word has length 49 [2021-07-05 17:22:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:09,514 INFO L442 AbstractCegarLoop]: Abstraction has 953 states and 1303 transitions. [2021-07-05 17:22:09,514 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1303 transitions. [2021-07-05 17:22:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-07-05 17:22:09,515 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:09,515 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:09,515 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-07-05 17:22:09,516 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash 145448510, now seen corresponding path program 1 times [2021-07-05 17:22:09,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:09,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440424499] [2021-07-05 17:22:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:09,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:09,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:09,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:22:09,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:22:09,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:22:09,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:22:09,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:22:09,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:09,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:09,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:09,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440424499] [2021-07-05 17:22:09,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440424499] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:09,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:09,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 17:22:09,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065427745] [2021-07-05 17:22:09,664 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 17:22:09,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:09,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 17:22:09,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 17:22:09,665 INFO L87 Difference]: Start difference. First operand 953 states and 1303 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:10,178 INFO L93 Difference]: Finished difference Result 3695 states and 5055 transitions. [2021-07-05 17:22:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-05 17:22:10,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-07-05 17:22:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:10,189 INFO L225 Difference]: With dead ends: 3695 [2021-07-05 17:22:10,189 INFO L226 Difference]: Without dead ends: 2756 [2021-07-05 17:22:10,192 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-07-05 17:22:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2021-07-05 17:22:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 951. [2021-07-05 17:22:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 950 states have (on average 1.3652631578947367) internal successors, (1297), 950 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1297 transitions. [2021-07-05 17:22:10,251 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1297 transitions. Word has length 49 [2021-07-05 17:22:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:10,251 INFO L442 AbstractCegarLoop]: Abstraction has 951 states and 1297 transitions. [2021-07-05 17:22:10,251 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1297 transitions. [2021-07-05 17:22:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-05 17:22:10,253 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:10,253 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:10,253 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2021-07-05 17:22:10,253 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1042941183, now seen corresponding path program 1 times [2021-07-05 17:22:10,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:10,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876292609] [2021-07-05 17:22:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:10,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:10,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:10,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:10,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:10,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:10,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:10,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:10,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:10,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876292609] [2021-07-05 17:22:10,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876292609] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:10,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:10,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:10,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051217221] [2021-07-05 17:22:10,393 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:10,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:10,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:10,394 INFO L87 Difference]: Start difference. First operand 951 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:10,672 INFO L93 Difference]: Finished difference Result 4255 states and 5812 transitions. [2021-07-05 17:22:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:22:10,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-05 17:22:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:10,691 INFO L225 Difference]: With dead ends: 4255 [2021-07-05 17:22:10,692 INFO L226 Difference]: Without dead ends: 3318 [2021-07-05 17:22:10,695 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2021-07-05 17:22:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 1823. [2021-07-05 17:22:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 1.3600439077936333) internal successors, (2478), 1822 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2478 transitions. [2021-07-05 17:22:10,794 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2478 transitions. Word has length 58 [2021-07-05 17:22:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:10,794 INFO L442 AbstractCegarLoop]: Abstraction has 1823 states and 2478 transitions. [2021-07-05 17:22:10,794 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2478 transitions. [2021-07-05 17:22:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-05 17:22:10,796 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:10,796 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:10,796 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-07-05 17:22:10,797 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1699019577, now seen corresponding path program 1 times [2021-07-05 17:22:10,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:10,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63605326] [2021-07-05 17:22:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:10,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:10,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:10,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:10,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:10,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:10,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:10,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:10,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:10,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63605326] [2021-07-05 17:22:10,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63605326] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:10,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:10,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:10,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355296029] [2021-07-05 17:22:10,904 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:10,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:10,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:10,905 INFO L87 Difference]: Start difference. First operand 1823 states and 2478 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:11,266 INFO L93 Difference]: Finished difference Result 3569 states and 4840 transitions. [2021-07-05 17:22:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-05 17:22:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:11,279 INFO L225 Difference]: With dead ends: 3569 [2021-07-05 17:22:11,279 INFO L226 Difference]: Without dead ends: 1760 [2021-07-05 17:22:11,282 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2021-07-05 17:22:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1747. [2021-07-05 17:22:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1746 states have (on average 1.3528064146620848) internal successors, (2362), 1746 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2362 transitions. [2021-07-05 17:22:11,368 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2362 transitions. Word has length 58 [2021-07-05 17:22:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:11,368 INFO L442 AbstractCegarLoop]: Abstraction has 1747 states and 2362 transitions. [2021-07-05 17:22:11,368 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2362 transitions. [2021-07-05 17:22:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-05 17:22:11,370 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:11,370 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:11,370 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-07-05 17:22:11,370 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash 589140347, now seen corresponding path program 1 times [2021-07-05 17:22:11,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:11,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305597942] [2021-07-05 17:22:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:11,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:11,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:11,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:11,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:11,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:11,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:11,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:11,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:11,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-05 17:22:11,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:11,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:11,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:11,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305597942] [2021-07-05 17:22:11,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305597942] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:11,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:11,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 17:22:11,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240299127] [2021-07-05 17:22:11,599 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 17:22:11,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 17:22:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 17:22:11,600 INFO L87 Difference]: Start difference. First operand 1747 states and 2362 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:12,297 INFO L93 Difference]: Finished difference Result 4485 states and 6059 transitions. [2021-07-05 17:22:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-05 17:22:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-07-05 17:22:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:12,302 INFO L225 Difference]: With dead ends: 4485 [2021-07-05 17:22:12,302 INFO L226 Difference]: Without dead ends: 2700 [2021-07-05 17:22:12,305 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 266.2ms TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-07-05 17:22:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2021-07-05 17:22:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 1695. [2021-07-05 17:22:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.3518299881936247) internal successors, (2290), 1694 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2290 transitions. [2021-07-05 17:22:12,407 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2290 transitions. Word has length 66 [2021-07-05 17:22:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:12,407 INFO L442 AbstractCegarLoop]: Abstraction has 1695 states and 2290 transitions. [2021-07-05 17:22:12,407 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2290 transitions. [2021-07-05 17:22:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-05 17:22:12,409 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:12,409 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:12,409 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-07-05 17:22:12,409 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1323881078, now seen corresponding path program 1 times [2021-07-05 17:22:12,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:12,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397675522] [2021-07-05 17:22:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:12,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:12,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:12,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:12,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:12,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 17:22:12,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:12,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 17:22:12,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:12,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 17:22:12,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:12,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-05 17:22:12,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:12,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397675522] [2021-07-05 17:22:12,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397675522] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:12,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:12,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 17:22:12,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245332429] [2021-07-05 17:22:12,935 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 17:22:12,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 17:22:12,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:12,936 INFO L87 Difference]: Start difference. First operand 1695 states and 2290 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:13,086 INFO L93 Difference]: Finished difference Result 3378 states and 4566 transitions. [2021-07-05 17:22:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:22:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-05 17:22:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:13,090 INFO L225 Difference]: With dead ends: 3378 [2021-07-05 17:22:13,090 INFO L226 Difference]: Without dead ends: 1693 [2021-07-05 17:22:13,092 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 17:22:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2021-07-05 17:22:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1693. [2021-07-05 17:22:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1692 states have (on average 1.351063829787234) internal successors, (2286), 1692 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2286 transitions. [2021-07-05 17:22:13,196 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2286 transitions. Word has length 68 [2021-07-05 17:22:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:13,196 INFO L442 AbstractCegarLoop]: Abstraction has 1693 states and 2286 transitions. [2021-07-05 17:22:13,196 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2286 transitions. [2021-07-05 17:22:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-05 17:22:13,198 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:13,198 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 17:22:13,198 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2021-07-05 17:22:13,199 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1468975635, now seen corresponding path program 1 times [2021-07-05 17:22:13,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:13,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299048026] [2021-07-05 17:22:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:13,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:13,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:13,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:13,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:13,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:13,699 INFO L142 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-07-05 17:22:13,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 17:22:13,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:13,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-05 17:22:13,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:13,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299048026] [2021-07-05 17:22:13,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299048026] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:13,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:13,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:13,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422276124] [2021-07-05 17:22:13,706 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:13,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:13,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:13,707 INFO L87 Difference]: Start difference. First operand 1693 states and 2286 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:15,885 INFO L93 Difference]: Finished difference Result 2634 states and 3545 transitions. [2021-07-05 17:22:15,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:15,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-05 17:22:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:15,887 INFO L225 Difference]: With dead ends: 2634 [2021-07-05 17:22:15,887 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 17:22:15,890 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 17:22:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 17:22:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 17:22:15,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-07-05 17:22:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:15,891 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 17:22:15,891 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 17:22:15,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 17:22:15,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 17:22:15,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:15,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:15,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:15,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:16,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:17,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:18,920 INFO L762 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,921 INFO L762 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,921 INFO L762 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L762 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,921 INFO L762 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L762 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L4069-1(lines 4068 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,921 INFO L762 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-07-05 17:22:18,921 INFO L758 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L4075-1(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,922 INFO L758 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-07-05 17:22:18,922 INFO L762 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L758 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L758 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L758 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L758 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:18,923 INFO L758 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,923 INFO L758 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,923 INFO L758 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-07-05 17:22:18,923 INFO L762 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L758 garLoopResultBuilder]: At program point L4081-1(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,924 INFO L758 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L758 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L758 garLoopResultBuilder]: At program point L5139(lines 1 5156) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:18,924 INFO L758 garLoopResultBuilder]: At program point L5139-1(lines 5047 5052) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L758 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,924 INFO L762 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:18,925 INFO L762 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:18,925 INFO L762 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L5075(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L5075-1(lines 5072 5076) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L4084-1(lines 4083 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0))) (and (or (and .cse0 (<= 0 ~ldv_urb_state~0) .cse1 .cse2 .cse3) .cse4) (let ((.cse5 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse5 .cse2 .cse6 .cse7 .cse3) (and (not (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) .cse0 (not .cse1) (not .cse3) .cse5 .cse4 (not (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (<= ~ldv_urb_state~0 1) .cse2 .cse6) (and (= ULTIMATE.start_usb_free_urb_~urb.offset 0) .cse0 .cse5 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) .cse2 .cse6 .cse7))))) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L5075-2(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L5075-3(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,925 INFO L758 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,926 INFO L762 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,926 INFO L758 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,926 INFO L758 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,926 INFO L758 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,926 INFO L758 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,926 INFO L762 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-07-05 17:22:18,926 INFO L762 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,926 INFO L762 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,926 INFO L758 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,926 INFO L762 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:18,926 INFO L762 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:18,926 INFO L758 garLoopResultBuilder]: At program point L5078(lines 5077 5079) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,926 INFO L762 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-07-05 17:22:18,926 INFO L758 garLoopResultBuilder]: At program point L4087-1(lines 4086 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,927 INFO L758 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,927 INFO L758 garLoopResultBuilder]: At program point L5078-1(lines 5077 5079) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L758 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L758 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:18,927 INFO L758 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,927 INFO L758 garLoopResultBuilder]: At program point L4090-1(lines 4089 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-07-05 17:22:18,927 INFO L762 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,928 INFO L762 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,928 INFO L762 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,928 INFO L762 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,928 INFO L762 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L5017-2loopEntry(lines 5017 5036) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_urb_state~0))) (and .cse0 (let ((.cse1 (= ULTIMATE.start_usb_free_urb_~urb.offset 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~ldv_urb_state~0 0)) (and .cse1 .cse2 .cse3 .cse0 .cse4 (<= ~ldv_urb_state~0 1) .cse5 .cse6))))) [2021-07-05 17:22:18,928 INFO L758 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_urb_state~0))) (and .cse0 (let ((.cse1 (= ULTIMATE.start_usb_free_urb_~urb.offset 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~ldv_urb_state~0 0)) (and .cse1 .cse2 .cse3 .cse0 .cse4 (<= ~ldv_urb_state~0 1) .cse5 .cse6))))) [2021-07-05 17:22:18,928 INFO L762 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-07-05 17:22:18,928 INFO L762 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,928 INFO L762 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L758 garLoopResultBuilder]: At program point L4093-1(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,929 INFO L758 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) (= ~ir_add_bof~0 0) .cse0)))) [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L758 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L758 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L758 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,929 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 17:22:18,929 INFO L758 garLoopResultBuilder]: At program point L4095-1(lines 4094 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,929 INFO L758 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L758 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L758 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L758 garLoopResultBuilder]: At program point L5154(lines 1 5156) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L758 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L758 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-07-05 17:22:18,930 INFO L762 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:18,931 INFO L762 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:18,931 INFO L758 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,931 INFO L758 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,931 INFO L762 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,931 INFO L758 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,931 INFO L762 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-07-05 17:22:18,931 INFO L758 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,931 INFO L762 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-07-05 17:22:18,931 INFO L758 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,931 INFO L762 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:18,932 INFO L758 garLoopResultBuilder]: At program point L5092(lines 4860 4863) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,932 INFO L762 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-07-05 17:22:18,932 INFO L762 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:18,932 INFO L762 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:18,932 INFO L762 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,932 INFO L758 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-07-05 17:22:18,932 INFO L762 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-07-05 17:22:18,932 INFO L758 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,932 INFO L762 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:18,933 INFO L762 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:18,933 INFO L758 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,933 INFO L762 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-07-05 17:22:18,933 INFO L762 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-07-05 17:22:18,933 INFO L762 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:18,933 INFO L762 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-07-05 17:22:18,933 INFO L758 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:18,933 INFO L762 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-07-05 17:22:18,934 INFO L758 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:18,934 INFO L762 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,934 INFO L758 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,934 INFO L762 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-07-05 17:22:18,934 INFO L758 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,934 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,934 INFO L758 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,935 INFO L758 garLoopResultBuilder]: At program point L5098(lines 5097 5099) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (let ((.cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and (not .cse1) .cse2 (not .cse3) .cse4 .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse0))))) [2021-07-05 17:22:18,935 INFO L758 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,935 INFO L762 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,935 INFO L762 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:18,935 INFO L762 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:18,935 INFO L758 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,935 INFO L762 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-07-05 17:22:18,936 INFO L762 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,936 INFO L758 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,936 INFO L758 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,936 INFO L762 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-07-05 17:22:18,936 INFO L762 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-07-05 17:22:18,936 INFO L758 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,936 INFO L758 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,936 INFO L762 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-07-05 17:22:18,937 INFO L758 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,937 INFO L762 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:18,937 INFO L762 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:18,937 INFO L765 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-07-05 17:22:18,937 INFO L762 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-07-05 17:22:18,937 INFO L758 garLoopResultBuilder]: At program point L3651-1(lines 3644 3653) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,937 INFO L758 garLoopResultBuilder]: At program point L3651(lines 3644 3653) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,937 INFO L762 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-07-05 17:22:18,938 INFO L758 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,938 INFO L758 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,938 INFO L758 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,938 INFO L758 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,938 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 17:22:18,938 INFO L762 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-07-05 17:22:18,938 INFO L762 garLoopResultBuilder]: For program point L4909-2(lines 5053 5058) no Hoare annotation was computed. [2021-07-05 17:22:18,938 INFO L765 garLoopResultBuilder]: At program point L4909-3(lines 5044 5061) the Hoare annotation is: true [2021-07-05 17:22:18,939 INFO L762 garLoopResultBuilder]: For program point L4909(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:18,939 INFO L762 garLoopResultBuilder]: For program point L4909-1(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:18,939 INFO L758 garLoopResultBuilder]: At program point L4645(lines 4614 4647) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:18,939 INFO L758 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,939 INFO L758 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,939 INFO L762 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-07-05 17:22:18,939 INFO L758 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,939 INFO L762 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,940 INFO L762 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:18,941 INFO L758 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,941 INFO L758 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,941 INFO L758 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,941 INFO L762 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-07-05 17:22:18,941 INFO L758 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) (= ~ir_add_bof~0 0) .cse0)))) [2021-07-05 17:22:18,941 INFO L758 garLoopResultBuilder]: At program point L4122-1(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,941 INFO L762 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-07-05 17:22:18,941 INFO L758 garLoopResultBuilder]: At program point L3726(lines 3723 3728) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5)) [2021-07-05 17:22:18,942 INFO L758 garLoopResultBuilder]: At program point L3726-1(lines 3723 3728) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,942 INFO L762 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:18,942 INFO L762 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:18,942 INFO L758 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,942 INFO L758 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,942 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 17:22:18,942 INFO L758 garLoopResultBuilder]: At program point L4125-1(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,943 INFO L758 garLoopResultBuilder]: At program point L4125(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) (= ~ir_add_bof~0 0) .cse0)))) [2021-07-05 17:22:18,943 INFO L758 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,943 INFO L762 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:18,943 INFO L762 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:18,943 INFO L762 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-07-05 17:22:18,943 INFO L762 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-07-05 17:22:18,943 INFO L762 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-07-05 17:22:18,943 INFO L758 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,943 INFO L762 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:18,944 INFO L762 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:18,944 INFO L758 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,944 INFO L765 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:18,944 INFO L765 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:18,944 INFO L758 garLoopResultBuilder]: At program point L3732(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,944 INFO L758 garLoopResultBuilder]: At program point L3732-1(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0))) [2021-07-05 17:22:18,944 INFO L758 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,945 INFO L762 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-07-05 17:22:18,945 INFO L762 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-07-05 17:22:18,945 INFO L758 garLoopResultBuilder]: At program point L5122(lines 5121 5123) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0)) [2021-07-05 17:22:18,945 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2021-07-05 17:22:18,945 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 17:22:18,945 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/4) [2021-07-05 17:22:18,947 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 17:22:18,947 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 17:22:18,947 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 17:22:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-07-05 17:22:18,950 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:18,950 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:18,950 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:18,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash 523606816, now seen corresponding path program 1 times [2021-07-05 17:22:18,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:18,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911069144] [2021-07-05 17:22:18,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:18,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:19,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:19,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:22:19,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:19,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:19,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:19,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:19,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:19,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911069144] [2021-07-05 17:22:19,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911069144] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:19,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:19,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:22:19,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573025259] [2021-07-05 17:22:19,029 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:22:19,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:22:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:22:19,030 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:19,281 INFO L93 Difference]: Finished difference Result 788 states and 1214 transitions. [2021-07-05 17:22:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:22:19,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-07-05 17:22:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:19,282 INFO L225 Difference]: With dead ends: 788 [2021-07-05 17:22:19,282 INFO L226 Difference]: Without dead ends: 492 [2021-07-05 17:22:19,283 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:22:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-07-05 17:22:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 266. [2021-07-05 17:22:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.3547169811320754) internal successors, (359), 265 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2021-07-05 17:22:19,287 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 13 [2021-07-05 17:22:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:19,287 INFO L442 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2021-07-05 17:22:19,287 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2021-07-05 17:22:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-07-05 17:22:19,288 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:22:19,288 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:22:19,288 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2021-07-05 17:22:19,288 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:22:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:22:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash 130579806, now seen corresponding path program 1 times [2021-07-05 17:22:19,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:22:19,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122276462] [2021-07-05 17:22:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:22:19,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:22:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:22:19,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:19,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:22:19,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:22:19,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:22:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:22:19,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:22:19,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122276462] [2021-07-05 17:22:19,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122276462] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:22:19,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:22:19,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 17:22:19,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176227585] [2021-07-05 17:22:19,362 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 17:22:19,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:22:19,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 17:22:19,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 17:22:19,363 INFO L87 Difference]: Start difference. First operand 266 states and 359 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:22:19,366 INFO L93 Difference]: Finished difference Result 266 states and 359 transitions. [2021-07-05 17:22:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 17:22:19,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-07-05 17:22:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:22:19,367 INFO L225 Difference]: With dead ends: 266 [2021-07-05 17:22:19,367 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 17:22:19,367 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 17:22:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 17:22:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 17:22:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 17:22:19,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2021-07-05 17:22:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:22:19,368 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 17:22:19,369 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:22:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 17:22:19,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 17:22:19,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 17:22:19,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:22:19,616 INFO L762 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-07-05 17:22:19,616 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,616 INFO L758 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,616 INFO L758 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,616 INFO L762 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-07-05 17:22:19,616 INFO L758 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,616 INFO L762 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-07-05 17:22:19,616 INFO L762 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,616 INFO L758 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,616 INFO L762 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,616 INFO L762 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L4069-1(lines 4068 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L762 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,617 INFO L758 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,618 INFO L762 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,618 INFO L762 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-07-05 17:22:19,618 INFO L758 garLoopResultBuilder]: At program point L4075-1(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,618 INFO L758 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,618 INFO L758 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:19,618 INFO L762 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-07-05 17:22:19,618 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,618 INFO L758 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,618 INFO L762 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-07-05 17:22:19,618 INFO L758 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,618 INFO L762 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L758 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L758 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_coherent_state~0 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:19,619 INFO L758 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,619 INFO L758 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,619 INFO L758 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L758 garLoopResultBuilder]: At program point L4081-1(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,619 INFO L758 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-07-05 17:22:19,619 INFO L762 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-07-05 17:22:19,622 INFO L758 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,622 INFO L762 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,622 INFO L762 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L758 garLoopResultBuilder]: At program point L5139(lines 1 5156) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_coherent_state~0 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:19,623 INFO L758 garLoopResultBuilder]: At program point L5139-1(lines 5047 5052) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L758 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L762 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-07-05 17:22:19,623 INFO L758 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,623 INFO L758 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,624 INFO L758 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,624 INFO L758 garLoopResultBuilder]: At program point L5075(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,624 INFO L758 garLoopResultBuilder]: At program point L5075-1(lines 5072 5076) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,624 INFO L758 garLoopResultBuilder]: At program point L4084-1(lines 4083 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,624 INFO L758 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0))) (and (or (and .cse0 (<= 0 ~ldv_urb_state~0) .cse1 .cse2 .cse3) .cse4) (= ~ldv_coherent_state~0 0) (let ((.cse5 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse5 .cse2 .cse6 .cse7 .cse3) (and (not (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) .cse0 (not .cse1) (not .cse3) .cse5 .cse4 (not (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (<= ~ldv_urb_state~0 1) .cse2 .cse6) (and (= ULTIMATE.start_usb_free_urb_~urb.offset 0) .cse0 .cse5 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) .cse2 .cse6 .cse7))))) [2021-07-05 17:22:19,624 INFO L758 garLoopResultBuilder]: At program point L5075-2(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,624 INFO L758 garLoopResultBuilder]: At program point L5075-3(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,625 INFO L758 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,625 INFO L758 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,625 INFO L762 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,625 INFO L758 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,625 INFO L758 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,625 INFO L758 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,625 INFO L758 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L758 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L758 garLoopResultBuilder]: At program point L5078(lines 5077 5079) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L758 garLoopResultBuilder]: At program point L4087-1(lines 4086 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,626 INFO L758 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,626 INFO L758 garLoopResultBuilder]: At program point L5078-1(lines 5077 5079) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-07-05 17:22:19,626 INFO L762 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_coherent_state~0 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L4090-1(lines 4089 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,627 INFO L762 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-07-05 17:22:19,627 INFO L758 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,628 INFO L758 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_coherent_state~0 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:19,628 INFO L758 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,628 INFO L758 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,628 INFO L762 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,628 INFO L762 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-07-05 17:22:19,628 INFO L758 garLoopResultBuilder]: At program point L5017-2loopEntry(lines 5017 5036) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_urb_state~0))) (and .cse0 (= ~ldv_coherent_state~0 0) (let ((.cse1 (= ULTIMATE.start_usb_free_urb_~urb.offset 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~ldv_urb_state~0 0)) (and .cse1 .cse2 .cse3 .cse0 .cse4 (<= ~ldv_urb_state~0 1) .cse5 .cse6))))) [2021-07-05 17:22:19,628 INFO L758 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_urb_state~0))) (and .cse0 (= ~ldv_coherent_state~0 0) (let ((.cse1 (= ULTIMATE.start_usb_free_urb_~urb.offset 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~ldv_urb_state~0 0)) (and .cse1 .cse2 .cse3 .cse0 .cse4 (<= ~ldv_urb_state~0 1) .cse5 .cse6))))) [2021-07-05 17:22:19,629 INFO L762 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-07-05 17:22:19,629 INFO L762 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,629 INFO L762 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:19,629 INFO L762 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-07-05 17:22:19,629 INFO L762 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:19,629 INFO L758 garLoopResultBuilder]: At program point L4093-1(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,629 INFO L758 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0) (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) (= ~ir_add_bof~0 0) .cse0)))) [2021-07-05 17:22:19,629 INFO L762 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:19,629 INFO L762 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-07-05 17:22:19,630 INFO L762 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:19,630 INFO L758 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,630 INFO L762 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,630 INFO L758 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,630 INFO L762 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:19,630 INFO L762 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-07-05 17:22:19,630 INFO L758 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,630 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 17:22:19,631 INFO L758 garLoopResultBuilder]: At program point L4095-1(lines 4094 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,631 INFO L758 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,631 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,631 INFO L762 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,631 INFO L758 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,631 INFO L762 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-07-05 17:22:19,631 INFO L762 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-07-05 17:22:19,632 INFO L758 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,632 INFO L762 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-07-05 17:22:19,632 INFO L758 garLoopResultBuilder]: At program point L5154(lines 1 5156) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,632 INFO L762 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,632 INFO L762 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:19,632 INFO L762 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-07-05 17:22:19,632 INFO L762 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-07-05 17:22:19,632 INFO L758 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,632 INFO L762 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-07-05 17:22:19,632 INFO L758 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,633 INFO L762 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-07-05 17:22:19,633 INFO L762 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:19,633 INFO L762 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-07-05 17:22:19,633 INFO L758 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,633 INFO L758 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,633 INFO L762 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,633 INFO L758 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,633 INFO L762 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-07-05 17:22:19,633 INFO L758 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,633 INFO L762 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-07-05 17:22:19,633 INFO L758 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,633 INFO L762 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:19,633 INFO L758 garLoopResultBuilder]: At program point L5092(lines 4860 4863) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,634 INFO L762 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-07-05 17:22:19,634 INFO L762 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-07-05 17:22:19,634 INFO L762 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:19,634 INFO L762 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,634 INFO L758 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-07-05 17:22:19,634 INFO L762 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-07-05 17:22:19,634 INFO L758 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,634 INFO L762 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:19,634 INFO L762 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-07-05 17:22:19,635 INFO L758 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,635 INFO L762 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-07-05 17:22:19,635 INFO L762 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-07-05 17:22:19,635 INFO L762 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-07-05 17:22:19,635 INFO L762 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-07-05 17:22:19,635 INFO L758 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_coherent_state~0 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:19,635 INFO L762 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-07-05 17:22:19,635 INFO L758 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_coherent_state~0 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:19,635 INFO L762 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,635 INFO L758 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L5098(lines 5097 5099) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (let ((.cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and (not .cse1) .cse2 (not .cse3) .cse4 .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse0))) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L762 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,636 INFO L758 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,637 INFO L762 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-07-05 17:22:19,637 INFO L758 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,637 INFO L762 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:19,637 INFO L762 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-07-05 17:22:19,637 INFO L765 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-07-05 17:22:19,637 INFO L762 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-07-05 17:22:19,637 INFO L758 garLoopResultBuilder]: At program point L3651-1(lines 3644 3653) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,637 INFO L758 garLoopResultBuilder]: At program point L3651(lines 3644 3653) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,637 INFO L762 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-07-05 17:22:19,637 INFO L758 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,637 INFO L758 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,637 INFO L758 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,638 INFO L758 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point L4909-2(lines 5053 5058) no Hoare annotation was computed. [2021-07-05 17:22:19,638 INFO L765 garLoopResultBuilder]: At program point L4909-3(lines 5044 5061) the Hoare annotation is: true [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point L4909(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point L4909-1(lines 1 5156) no Hoare annotation was computed. [2021-07-05 17:22:19,638 INFO L758 garLoopResultBuilder]: At program point L4645(lines 4614 4647) the Hoare annotation is: (and (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (= ~ldv_coherent_state~0 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) [2021-07-05 17:22:19,638 INFO L758 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,638 INFO L758 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-07-05 17:22:19,638 INFO L758 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:19,638 INFO L762 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L758 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,639 INFO L758 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,639 INFO L758 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-07-05 17:22:19,639 INFO L758 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0) (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) (= ~ir_add_bof~0 0) .cse0)))) [2021-07-05 17:22:19,639 INFO L758 garLoopResultBuilder]: At program point L4122-1(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,639 INFO L762 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-07-05 17:22:19,640 INFO L758 garLoopResultBuilder]: At program point L3726(lines 3723 3728) the Hoare annotation is: (let ((.cse5 (<= 1 ~ldv_urb_state~0))) (and (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_urb_state~0 0)) (and .cse0 .cse1 .cse5 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4))) .cse5 (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,640 INFO L758 garLoopResultBuilder]: At program point L3726-1(lines 3723 3728) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,640 INFO L762 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:19,640 INFO L762 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-07-05 17:22:19,640 INFO L758 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,640 INFO L758 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,640 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 17:22:19,640 INFO L758 garLoopResultBuilder]: At program point L4125-1(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,640 INFO L758 garLoopResultBuilder]: At program point L4125(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0) (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) (= ~ir_add_bof~0 0) .cse0)))) [2021-07-05 17:22:19,641 INFO L758 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,641 INFO L762 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:19,641 INFO L762 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-07-05 17:22:19,641 INFO L762 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-07-05 17:22:19,641 INFO L762 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-07-05 17:22:19,641 INFO L762 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-07-05 17:22:19,641 INFO L758 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,641 INFO L762 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:19,642 INFO L762 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-07-05 17:22:19,642 INFO L758 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,642 INFO L765 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:19,642 INFO L765 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-07-05 17:22:19,642 INFO L758 garLoopResultBuilder]: At program point L3732(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,642 INFO L758 garLoopResultBuilder]: At program point L3732-1(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (and (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) .cse0) (and (= ~ir_add_bof~0 0) .cse0)) (or (<= 1 ~ldv_urb_state~0) .cse0) (= ~ldv_coherent_state~0 0))) [2021-07-05 17:22:19,644 INFO L758 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,644 INFO L762 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-07-05 17:22:19,644 INFO L762 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-07-05 17:22:19,644 INFO L758 garLoopResultBuilder]: At program point L5122(lines 5121 5123) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0))) (and (or (<= 1 ~ldv_urb_state~0) .cse0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) .cse0)) [2021-07-05 17:22:19,644 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2021-07-05 17:22:19,644 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 17:22:19,645 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/4) [2021-07-05 17:22:19,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.07 05:22:19 BoogieIcfgContainer [2021-07-05 17:22:19,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-05 17:22:19,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-05 17:22:19,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-05 17:22:19,722 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-05 17:22:19,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 05:21:50" (3/4) ... [2021-07-05 17:22:19,726 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-07-05 17:22:19,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 138 nodes and edges [2021-07-05 17:22:19,766 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2021-07-05 17:22:19,768 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-07-05 17:22:19,770 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-07-05 17:22:19,772 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-07-05 17:22:19,773 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-07-05 17:22:19,775 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-05 17:22:19,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= ldv_urb_state || ldv_urb_state == 0) && ldv_coherent_state == 0) && ((\result == 0 && ldv_urb_state == 0) || ((xbof___0 == 0 && ir_add_bof == 0) && ldv_urb_state == 0)) [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= ldv_urb_state || ldv_urb_state == 0) && ldv_coherent_state == 0) && ((\result == 0 && ldv_urb_state == 0) || ((xbof___0 == 0 && ir_add_bof == 0) && ldv_urb_state == 0)) [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= ldv_urb_state || ldv_urb_state == 0) && ldv_coherent_state == 0) && ((\result == 0 && ldv_urb_state == 0) || ((xbof___0 == 0 && ir_add_bof == 0) && ldv_urb_state == 0)) [2021-07-05 17:22:19,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0 && 0 <= ldv_urb_state) && \result == 0) && arbitrary_memory == 0) && arbitrary_memory == 0) || 1 <= ldv_urb_state) && ldv_coherent_state == 0) && (((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && arbitrary_memory == 0) || (((((((((!(\result == 0) && \result == 0) && !(\result == 0)) && !(arbitrary_memory == 0)) && \result == 0) && 1 <= ldv_urb_state) && !(\result == 0)) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) || ((((((urb == 0 && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0)) [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= ldv_urb_state || ldv_urb_state == 0) && (((((!(\result == 0) && \result == 0) && !(\result == 0)) && \result == 0) && ldv_urb_state == 0) || ((((\result == 0 && \result == 0) && \result == 0) && \result == 0) && ldv_urb_state == 0))) && ldv_coherent_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 <= ldv_urb_state && ldv_coherent_state == 0) && (((((((urb == 0 && \result == 0) && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || (((((((urb == 0 && \result == 0) && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 [2021-07-05 17:22:19,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 [2021-07-05 17:22:19,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 <= ldv_urb_state && ldv_coherent_state == 0) && (((((((urb == 0 && \result == 0) && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || (((((((urb == 0 && \result == 0) && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) [2021-07-05 17:22:20,021 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-05 17:22:20,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-05 17:22:20,022 INFO L168 Benchmark]: Toolchain (without parser) took 35440.05 ms. Allocated memory was 52.4 MB in the beginning and 511.7 MB in the end (delta: 459.3 MB). Free memory was 22.7 MB in the beginning and 276.4 MB in the end (delta: -253.7 MB). Peak memory consumption was 202.8 MB. Max. memory is 16.1 GB. [2021-07-05 17:22:20,023 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.1 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 17:22:20,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1043.16 ms. Allocated memory was 52.4 MB in the beginning and 77.6 MB in the end (delta: 25.2 MB). Free memory was 22.5 MB in the beginning and 35.6 MB in the end (delta: -13.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. [2021-07-05 17:22:20,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.04 ms. Allocated memory is still 77.6 MB. Free memory was 35.6 MB in the beginning and 39.3 MB in the end (delta: -3.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2021-07-05 17:22:20,023 INFO L168 Benchmark]: Boogie Preprocessor took 149.99 ms. Allocated memory is still 77.6 MB. Free memory was 39.3 MB in the beginning and 29.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-05 17:22:20,023 INFO L168 Benchmark]: RCFGBuilder took 4758.95 ms. Allocated memory was 77.6 MB in the beginning and 224.4 MB in the end (delta: 146.8 MB). Free memory was 29.7 MB in the beginning and 129.2 MB in the end (delta: -99.4 MB). Peak memory consumption was 121.1 MB. Max. memory is 16.1 GB. [2021-07-05 17:22:20,023 INFO L168 Benchmark]: TraceAbstraction took 29033.53 ms. Allocated memory was 224.4 MB in the beginning and 511.7 MB in the end (delta: 287.3 MB). Free memory was 128.1 MB in the beginning and 421.1 MB in the end (delta: -293.0 MB). Peak memory consumption was 253.3 MB. Max. memory is 16.1 GB. [2021-07-05 17:22:20,024 INFO L168 Benchmark]: Witness Printer took 305.39 ms. Allocated memory is still 511.7 MB. Free memory was 421.1 MB in the beginning and 276.4 MB in the end (delta: 144.7 MB). Peak memory consumption was 142.6 MB. Max. memory is 16.1 GB. [2021-07-05 17:22:20,025 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.19 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.1 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1043.16 ms. Allocated memory was 52.4 MB in the beginning and 77.6 MB in the end (delta: 25.2 MB). Free memory was 22.5 MB in the beginning and 35.6 MB in the end (delta: -13.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 142.04 ms. Allocated memory is still 77.6 MB. Free memory was 35.6 MB in the beginning and 39.3 MB in the end (delta: -3.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 149.99 ms. Allocated memory is still 77.6 MB. Free memory was 39.3 MB in the beginning and 29.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4758.95 ms. Allocated memory was 77.6 MB in the beginning and 224.4 MB in the end (delta: 146.8 MB). Free memory was 29.7 MB in the beginning and 129.2 MB in the end (delta: -99.4 MB). Peak memory consumption was 121.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 29033.53 ms. Allocated memory was 224.4 MB in the beginning and 511.7 MB in the end (delta: 287.3 MB). Free memory was 128.1 MB in the beginning and 421.1 MB in the end (delta: -293.0 MB). Peak memory consumption was 253.3 MB. Max. memory is 16.1 GB. * Witness Printer took 305.39 ms. Allocated memory is still 511.7 MB. Free memory was 421.1 MB in the beginning and 276.4 MB in the end (delta: 144.7 MB). Peak memory consumption was 142.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 279 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 10051.3ms, OverallIterations: 7, TraceHistogramMax: 2, EmptinessCheckTime: 39.3ms, AutomataDifference: 5849.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2158.8ms, InitialAbstractionConstructionTime: 12.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4443 SDtfs, 6199 SDslu, 8917 SDs, 0 SdLazy, 449 SolverSat, 20 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4735.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 284.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=975occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 243.5ms AutomataMinimizationTime, 7 MinimizatonAttempts, 5124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 770 NumberOfFragments, 904 HoareAnnotationTreeSize, 128 FomulaSimplifications, 359078 FormulaSimplificationTreeSizeReduction, 935.6ms HoareSimplificationTime, 128 FomulaSimplificationsInter, 325 FormulaSimplificationTreeSizeReductionInter, 1196.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 84.7ms SsaConstructionTime, 550.2ms SatisfiabilityAnalysisTime, 843.7ms InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 36/36 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 279 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7399.8ms, OverallIterations: 6, TraceHistogramMax: 2, EmptinessCheckTime: 11.8ms, AutomataDifference: 5151.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1361.1ms, InitialAbstractionConstructionTime: 2.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3728 SDtfs, 4350 SDslu, 6141 SDs, 0 SdLazy, 361 SolverSat, 14 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4605.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 122.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 108.0ms AutomataMinimizationTime, 6 MinimizatonAttempts, 3479 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 764 NumberOfFragments, 904 HoareAnnotationTreeSize, 128 FomulaSimplifications, 71012 FormulaSimplificationTreeSizeReduction, 324.5ms HoareSimplificationTime, 128 FomulaSimplificationsInter, 371 FormulaSimplificationTreeSizeReductionInter, 1020.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 56.9ms SsaConstructionTime, 230.0ms SatisfiabilityAnalysisTime, 387.8ms InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 41/41 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 279 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 10761.0ms, OverallIterations: 10, TraceHistogramMax: 2, EmptinessCheckTime: 11.2ms, AutomataDifference: 5033.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 3028.7ms, InitialAbstractionConstructionTime: 2.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5875 SDtfs, 8202 SDslu, 13276 SDs, 0 SdLazy, 759 SolverSat, 49 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3381.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 543.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1823occurred in iteration=6, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 571.7ms AutomataMinimizationTime, 10 MinimizatonAttempts, 8977 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 934 NumberOfFragments, 1958 HoareAnnotationTreeSize, 128 FomulaSimplifications, 488279 FormulaSimplificationTreeSizeReduction, 1848.0ms HoareSimplificationTime, 128 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1162.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 75.5ms SsaConstructionTime, 1172.0ms SatisfiabilityAnalysisTime, 756.5ms InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 481 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 24/24 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 279 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 697.6ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 1.1ms, AutomataDifference: 258.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 246.5ms, InitialAbstractionConstructionTime: 1.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 685 SDtfs, 680 SDslu, 639 SDs, 0 SdLazy, 134 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 199.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.2ms AutomataMinimizationTime, 2 MinimizatonAttempts, 226 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 258 NumberOfFragments, 432 HoareAnnotationTreeSize, 128 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 45.2ms HoareSimplificationTime, 128 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 195.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 13.1ms SsaConstructionTime, 46.1ms SatisfiabilityAnalysisTime, 79.4ms InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 60 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 3723]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: (1 <= ldv_urb_state && ldv_coherent_state == 0) && (((((((urb == 0 && \result == 0) && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || (((((((urb == 0 && \result == 0) && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4504]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3723]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: (1 <= ldv_urb_state && ldv_coherent_state == 0) && (((((((urb == 0 && \result == 0) && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || (((((((urb == 0 && \result == 0) && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: ((1 <= ldv_urb_state || ldv_urb_state == 0) && ldv_coherent_state == 0) && ((\result == 0 && ldv_urb_state == 0) || ((xbof___0 == 0 && ir_add_bof == 0) && ldv_urb_state == 0)) - InvariantResult [Line: 4037]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4514]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3822]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4469]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3818]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4992]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4512]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4614]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 && unknown-#memory_int-unknown[debug][debug] == 0) && ldv_coherent_state == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0 - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: ((1 <= ldv_urb_state || ldv_urb_state == 0) && ldv_coherent_state == 0) && ((\result == 0 && ldv_urb_state == 0) || ((xbof___0 == 0 && ir_add_bof == 0) && ldv_urb_state == 0)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 5142]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3629]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 5044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4273]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5131]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5128]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3689]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 && unknown-#memory_int-unknown[debug][debug] == 0) && ldv_coherent_state == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0 - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4799]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5150]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4293]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5111]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4616]: Loop Invariant Derived loop invariant: (((((unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 && (retval + 1 <= 0 || 0 < retval)) && unknown-#memory_int-unknown[debug][debug] == 0) && ldv_coherent_state == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3699]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 4277]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5067]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4278]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4234]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3655]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4151]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4294]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5097]: Loop Invariant Derived loop invariant: ((1 <= ldv_urb_state || ldv_urb_state == 0) && (((((!(\result == 0) && \result == 0) && !(\result == 0)) && \result == 0) && ldv_urb_state == 0) || ((((\result == 0 && \result == 0) && \result == 0) && \result == 0) && ldv_urb_state == 0))) && ldv_coherent_state == 0 - InvariantResult [Line: 5047]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4332]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: ((1 <= ldv_urb_state || ldv_urb_state == 0) && ldv_coherent_state == 0) && ((\result == 0 && ldv_urb_state == 0) || ((xbof___0 == 0 && ir_add_bof == 0) && ldv_urb_state == 0)) - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 5094]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 && unknown-#memory_int-unknown[debug][debug] == 0) && ldv_coherent_state == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3625]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 && (retval + 1 <= 0 || 0 < retval)) && unknown-#memory_int-unknown[debug][debug] == 0) && ldv_coherent_state == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0 - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4013]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4860]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3729]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3729]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4846]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5135]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 && unknown-#memory_int-unknown[debug][debug] == 0) && ldv_coherent_state == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0 - InvariantResult [Line: 5124]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5146]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 && unknown-#memory_int-unknown[debug][debug] == 0) && ldv_coherent_state == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0 - InvariantResult [Line: 4823]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5121]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4312]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4510]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 4843]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (((((((\result == 0 && \result == 0) && urb == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) || ((((((\result == 0 && \result == 0) && 1 <= ldv_urb_state) && urb == 0) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) && 1 <= ldv_urb_state) && ldv_coherent_state == 0 - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5107]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4840]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 3974]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3678]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4507]: Loop Invariant Derived loop invariant: (((\result == 0 && ldv_urb_state == 0) || (ir_add_bof == 0 && ldv_urb_state == 0)) && (1 <= ldv_urb_state || ldv_urb_state == 0)) && ldv_coherent_state == 0 - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 - InvariantResult [Line: 4987]: Loop Invariant Derived loop invariant: ((((((\result == 0 && 0 <= ldv_urb_state) && \result == 0) && arbitrary_memory == 0) && arbitrary_memory == 0) || 1 <= ldv_urb_state) && ldv_coherent_state == 0) && (((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && arbitrary_memory == 0) || (((((((((!(\result == 0) && \result == 0) && !(\result == 0)) && !(arbitrary_memory == 0)) && \result == 0) && 1 <= ldv_urb_state) && !(\result == 0)) && ldv_urb_state <= 1) && arbitrary_memory == 0) && \result == 0)) || ((((((urb == 0 && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0)) - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: (((1 <= ldv_urb_state || ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0 RESULT: Ultimate proved your program to be correct! [2021-07-05 17:22:20,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...