./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/960521-1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/960521-1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4591ef5e575ce80e216cc4837705a7c6f141a943d9af6ca1eb606ab877abd06b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:43:48,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:43:48,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:43:48,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:43:48,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:43:48,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:43:48,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:43:48,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:43:48,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:43:48,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:43:48,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:43:48,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:43:48,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:43:48,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:43:48,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:43:48,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:43:48,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:43:48,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:43:48,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:43:48,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:43:48,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:43:48,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:43:48,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:43:48,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:43:48,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:43:48,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:43:48,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:43:48,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:43:48,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:43:48,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:43:48,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:43:48,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:43:48,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:43:48,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:43:48,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:43:48,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:43:48,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:43:48,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:43:48,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:43:48,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:43:48,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:43:48,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:43:48,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:43:48,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:43:48,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:43:48,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:43:48,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:43:48,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:43:48,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:43:48,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:43:48,240 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:43:48,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:43:48,242 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:43:48,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:43:48,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:43:48,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:43:48,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:43:48,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:43:48,243 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:43:48,243 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:43:48,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:43:48,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:43:48,243 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:43:48,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:43:48,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:43:48,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:43:48,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:43:48,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:43:48,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:43:48,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:43:48,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:43:48,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:43:48,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4591ef5e575ce80e216cc4837705a7c6f141a943d9af6ca1eb606ab877abd06b [2022-11-20 10:43:48,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:43:48,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:43:48,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:43:48,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:43:48,580 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:43:48,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/memsafety/960521-1-1.i [2022-11-20 10:43:51,713 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:43:51,937 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:43:51,937 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/sv-benchmarks/c/memsafety/960521-1-1.i [2022-11-20 10:43:51,950 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/data/3a054fcf8/e40e530eef5a47adbb70efc076ffea6e/FLAG7ceaf2949 [2022-11-20 10:43:51,966 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/data/3a054fcf8/e40e530eef5a47adbb70efc076ffea6e [2022-11-20 10:43:51,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:43:51,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:43:51,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:43:51,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:43:51,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:43:51,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:43:51" (1/1) ... [2022-11-20 10:43:51,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fda7186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:51, skipping insertion in model container [2022-11-20 10:43:51,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:43:51" (1/1) ... [2022-11-20 10:43:51,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:43:52,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:43:52,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:43:52,387 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:43:52,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:43:52,485 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:43:52,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52 WrapperNode [2022-11-20 10:43:52,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:43:52,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:43:52,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:43:52,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:43:52,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,556 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-11-20 10:43:52,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:43:52,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:43:52,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:43:52,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:43:52,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,597 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:43:52,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:43:52,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:43:52,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:43:52,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (1/1) ... [2022-11-20 10:43:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:43:52,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:43:52,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:43:52,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:43:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:43:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:43:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:43:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:43:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:43:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:43:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:43:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:43:52,817 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:43:52,819 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:43:53,040 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:43:53,046 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:43:53,046 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:43:53,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:43:53 BoogieIcfgContainer [2022-11-20 10:43:53,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:43:53,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:43:53,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:43:53,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:43:53,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:43:51" (1/3) ... [2022-11-20 10:43:53,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b652133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:43:53, skipping insertion in model container [2022-11-20 10:43:53,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:43:52" (2/3) ... [2022-11-20 10:43:53,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b652133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:43:53, skipping insertion in model container [2022-11-20 10:43:53,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:43:53" (3/3) ... [2022-11-20 10:43:53,057 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1-1.i [2022-11-20 10:43:53,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:43:53,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-20 10:43:53,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:43:53,184 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ee0503b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:43:53,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-20 10:43:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 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) [2022-11-20 10:43:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 10:43:53,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:53,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 10:43:53,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-20 10:43:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:53,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425817413] [2022-11-20 10:43:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425817413] [2022-11-20 10:43:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425817413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:53,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:53,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:43:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868024629] [2022-11-20 10:43:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:53,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:43:53,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:43:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:43:53,668 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-11-20 10:43:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:53,728 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-11-20 10:43:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:43:53,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-20 10:43:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:53,739 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:43:53,740 INFO L226 Difference]: Without dead ends: 48 [2022-11-20 10:43:53,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:43:53,745 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:53,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:43:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-20 10:43:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-20 10:43:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 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) [2022-11-20 10:43:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-11-20 10:43:53,795 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2022-11-20 10:43:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:53,796 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-11-20 10:43:53,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-11-20 10:43:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-11-20 10:43:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 10:43:53,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:53,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 10:43:53,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:43:53,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:53,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-20 10:43:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:53,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454683885] [2022-11-20 10:43:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:54,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:54,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454683885] [2022-11-20 10:43:54,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454683885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:54,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:54,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:43:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783259228] [2022-11-20 10:43:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:54,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:43:54,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:43:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:43:54,054 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-11-20 10:43:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:54,106 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-11-20 10:43:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:43:54,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-20 10:43:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:54,108 INFO L225 Difference]: With dead ends: 47 [2022-11-20 10:43:54,109 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 10:43:54,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:43:54,110 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:54,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:43:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 10:43:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-20 10:43:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 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) [2022-11-20 10:43:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-11-20 10:43:54,122 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2022-11-20 10:43:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:54,122 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-11-20 10:43:54,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-11-20 10:43:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-11-20 10:43:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:43:54,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:54,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:43:54,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:43:54,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2022-11-20 10:43:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:54,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482366208] [2022-11-20 10:43:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:54,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482366208] [2022-11-20 10:43:54,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482366208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:54,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:54,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:43:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305365296] [2022-11-20 10:43:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:54,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:43:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:54,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:43:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:43:54,227 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-11-20 10:43:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:54,274 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-11-20 10:43:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:43:54,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-11-20 10:43:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:54,275 INFO L225 Difference]: With dead ends: 44 [2022-11-20 10:43:54,275 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 10:43:54,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:43:54,277 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:54,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:43:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 10:43:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-20 10:43:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 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) [2022-11-20 10:43:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-11-20 10:43:54,282 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2022-11-20 10:43:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:54,282 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-11-20 10:43:54,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-11-20 10:43:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-11-20 10:43:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:43:54,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:54,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:43:54,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:43:54,284 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-11-20 10:43:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:54,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427419339] [2022-11-20 10:43:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:54,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:54,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427419339] [2022-11-20 10:43:54,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427419339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:54,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:54,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:43:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901112187] [2022-11-20 10:43:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:54,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:43:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:43:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:43:54,671 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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) [2022-11-20 10:43:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:54,826 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-11-20 10:43:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:43:54,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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 6 [2022-11-20 10:43:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:54,828 INFO L225 Difference]: With dead ends: 51 [2022-11-20 10:43:54,828 INFO L226 Difference]: Without dead ends: 51 [2022-11-20 10:43:54,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:43:54,838 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:54,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 64 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:43:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-20 10:43:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-11-20 10:43:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 44 states have internal predecessors, (48), 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) [2022-11-20 10:43:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-11-20 10:43:54,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 6 [2022-11-20 10:43:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:54,852 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-11-20 10:43:54,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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) [2022-11-20 10:43:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-11-20 10:43:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:43:54,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:54,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:54,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:43:54,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash 59362067, now seen corresponding path program 1 times [2022-11-20 10:43:54,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:54,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870972091] [2022-11-20 10:43:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:54,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870972091] [2022-11-20 10:43:54,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870972091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:54,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:54,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:43:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63249833] [2022-11-20 10:43:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:54,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:43:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:43:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:43:54,928 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-11-20 10:43:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:54,957 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-11-20 10:43:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:43:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-11-20 10:43:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:54,959 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:43:54,959 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 10:43:54,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:43:54,960 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:54,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:43:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 10:43:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-11-20 10:43:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 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) [2022-11-20 10:43:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-20 10:43:54,964 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 8 [2022-11-20 10:43:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:54,965 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-20 10:43:54,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-11-20 10:43:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-20 10:43:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:43:54,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:54,966 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:54,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:43:54,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1841820687, now seen corresponding path program 1 times [2022-11-20 10:43:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:54,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272546350] [2022-11-20 10:43:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:55,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:55,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272546350] [2022-11-20 10:43:55,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272546350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:43:55,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557529613] [2022-11-20 10:43:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:55,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:43:55,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:43:55,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:43:55,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:43:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:55,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:43:55,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:55,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:43:55,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 10:43:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:55,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:55,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557529613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:55,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:43:55,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-20 10:43:55,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645975861] [2022-11-20 10:43:55,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:55,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:43:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:55,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:43:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:43:55,776 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 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) [2022-11-20 10:43:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:56,146 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-20 10:43:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:43:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 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 9 [2022-11-20 10:43:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:56,148 INFO L225 Difference]: With dead ends: 67 [2022-11-20 10:43:56,148 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 10:43:56,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:43:56,149 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 194 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:56,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 120 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:43:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 10:43:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2022-11-20 10:43:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.5) internal successors, (69), 59 states have internal predecessors, (69), 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) [2022-11-20 10:43:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-11-20 10:43:56,156 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 9 [2022-11-20 10:43:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:56,156 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-11-20 10:43:56,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 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) [2022-11-20 10:43:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-11-20 10:43:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:43:56,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:56,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:56,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:56,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:43:56,358 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash 463101433, now seen corresponding path program 1 times [2022-11-20 10:43:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:56,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395106715] [2022-11-20 10:43:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:43:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:56,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395106715] [2022-11-20 10:43:56,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395106715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:56,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:56,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:43:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743688526] [2022-11-20 10:43:56,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:56,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:43:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:43:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:43:56,415 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-11-20 10:43:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:56,474 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-11-20 10:43:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:43:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-11-20 10:43:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:56,477 INFO L225 Difference]: With dead ends: 58 [2022-11-20 10:43:56,477 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 10:43:56,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:43:56,479 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:56,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:43:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 10:43:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-20 10:43:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 57 states have internal predecessors, (65), 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) [2022-11-20 10:43:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-11-20 10:43:56,492 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 11 [2022-11-20 10:43:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:56,493 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-11-20 10:43:56,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-11-20 10:43:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-11-20 10:43:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:43:56,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:56,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:56,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:43:56,494 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 463101434, now seen corresponding path program 1 times [2022-11-20 10:43:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:56,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51350283] [2022-11-20 10:43:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:56,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51350283] [2022-11-20 10:43:56,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51350283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:43:56,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715803414] [2022-11-20 10:43:56,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:56,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:43:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:43:56,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:43:56,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:43:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:56,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:43:56,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:56,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:56,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715803414] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:56,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:43:56,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:43:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856753763] [2022-11-20 10:43:56,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:56,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:43:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:43:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:43:56,741 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-11-20 10:43:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:56,827 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-11-20 10:43:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:43:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 11 [2022-11-20 10:43:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:56,828 INFO L225 Difference]: With dead ends: 60 [2022-11-20 10:43:56,828 INFO L226 Difference]: Without dead ends: 60 [2022-11-20 10:43:56,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:43:56,829 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 160 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:56,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 142 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:43:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-20 10:43:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-11-20 10:43:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 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) [2022-11-20 10:43:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-20 10:43:56,834 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 11 [2022-11-20 10:43:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:56,834 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-20 10:43:56,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-11-20 10:43:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-20 10:43:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 10:43:56,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:56,835 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2022-11-20 10:43:56,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:57,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:43:57,043 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1941957673, now seen corresponding path program 2 times [2022-11-20 10:43:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:57,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57467501] [2022-11-20 10:43:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:57,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:57,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57467501] [2022-11-20 10:43:57,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57467501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:43:57,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996425816] [2022-11-20 10:43:57,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:43:57,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:43:57,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:43:57,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:43:57,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:43:57,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:43:57,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:43:57,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 10:43:57,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:57,620 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:43:57,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 10:43:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:57,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:58,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996425816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:58,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:43:58,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-11-20 10:43:58,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502660582] [2022-11-20 10:43:58,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:58,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:43:58,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:58,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:43:58,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:43:58,214 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 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) [2022-11-20 10:43:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:59,199 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-11-20 10:43:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:43:59,200 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 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 18 [2022-11-20 10:43:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:59,201 INFO L225 Difference]: With dead ends: 108 [2022-11-20 10:43:59,201 INFO L226 Difference]: Without dead ends: 108 [2022-11-20 10:43:59,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=314, Invalid=946, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 10:43:59,202 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 339 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:59,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 142 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:43:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-20 10:43:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2022-11-20 10:43:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 93 states have internal predecessors, (110), 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) [2022-11-20 10:43:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2022-11-20 10:43:59,207 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 18 [2022-11-20 10:43:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:59,208 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2022-11-20 10:43:59,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 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) [2022-11-20 10:43:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2022-11-20 10:43:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:43:59,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:59,209 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:59,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:59,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 10:43:59,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2089502828, now seen corresponding path program 2 times [2022-11-20 10:43:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:59,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827107152] [2022-11-20 10:43:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:43:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:43:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:43:59,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827107152] [2022-11-20 10:43:59,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827107152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:43:59,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307490238] [2022-11-20 10:43:59,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:43:59,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:43:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:43:59,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:43:59,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:43:59,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:43:59,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:43:59,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:43:59,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:59,623 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:43:59,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-20 10:43:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 10:43:59,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:43:59,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307490238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:59,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:43:59,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2022-11-20 10:43:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434352529] [2022-11-20 10:43:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:59,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:43:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:43:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:43:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:43:59,727 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-11-20 10:43:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:59,767 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-11-20 10:43:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:43:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 20 [2022-11-20 10:43:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:59,769 INFO L225 Difference]: With dead ends: 82 [2022-11-20 10:43:59,769 INFO L226 Difference]: Without dead ends: 82 [2022-11-20 10:43:59,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:43:59,771 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:59,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:43:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-20 10:43:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-20 10:43:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.263157894736842) internal successors, (96), 81 states have internal predecessors, (96), 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) [2022-11-20 10:43:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2022-11-20 10:43:59,789 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 20 [2022-11-20 10:43:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:59,789 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2022-11-20 10:43:59,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-11-20 10:43:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2022-11-20 10:43:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:43:59,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:59,791 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:59,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:59,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:43:59,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:43:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1417752011, now seen corresponding path program 1 times [2022-11-20 10:43:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:43:59,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694821216] [2022-11-20 10:43:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:44:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:44:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:44:00,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694821216] [2022-11-20 10:44:00,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694821216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:44:00,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040369473] [2022-11-20 10:44:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:00,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:44:00,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:44:00,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:44:00,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:44:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:00,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:44:00,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:44:00,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:44:00,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040369473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:00,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:44:00,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-20 10:44:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36491126] [2022-11-20 10:44:00,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:00,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 10:44:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:44:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 10:44:00,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:44:00,413 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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) [2022-11-20 10:44:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:00,658 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-11-20 10:44:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:44:00,658 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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 23 [2022-11-20 10:44:00,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:00,659 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:44:00,659 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 10:44:00,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:44:00,660 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 146 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:00,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 65 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:44:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 10:44:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2022-11-20 10:44:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 81 states have internal predecessors, (90), 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) [2022-11-20 10:44:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-11-20 10:44:00,663 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 23 [2022-11-20 10:44:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:00,664 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-11-20 10:44:00,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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) [2022-11-20 10:44:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-11-20 10:44:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:44:00,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:00,665 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1] [2022-11-20 10:44:00,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 10:44:00,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:44:00,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:44:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash 820795113, now seen corresponding path program 3 times [2022-11-20 10:44:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:44:00,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126200133] [2022-11-20 10:44:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:44:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:44:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:44:01,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126200133] [2022-11-20 10:44:01,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126200133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:44:01,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103065713] [2022-11-20 10:44:01,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:44:01,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:44:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:44:01,752 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:44:01,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:44:01,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:44:01,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:01,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:44:01,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:01,868 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 10:44:01,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2022-11-20 10:44:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-20 10:44:02,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-20 10:44:02,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103065713] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:02,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:44:02,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 23 [2022-11-20 10:44:02,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215941174] [2022-11-20 10:44:02,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:02,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:44:02,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:44:02,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:44:02,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:44:02,589 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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) [2022-11-20 10:44:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:04,080 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-11-20 10:44:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:44:04,081 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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 36 [2022-11-20 10:44:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:04,082 INFO L225 Difference]: With dead ends: 120 [2022-11-20 10:44:04,082 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 10:44:04,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 10:44:04,083 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 446 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:04,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 84 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:44:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 10:44:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 92. [2022-11-20 10:44:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 91 states have internal predecessors, (102), 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) [2022-11-20 10:44:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-20 10:44:04,087 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 36 [2022-11-20 10:44:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:04,087 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-20 10:44:04,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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) [2022-11-20 10:44:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-20 10:44:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 10:44:04,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:04,088 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:04,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:44:04,295 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:44:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1425185077, now seen corresponding path program 2 times [2022-11-20 10:44:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:44:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540425320] [2022-11-20 10:44:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:44:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:44:04,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:44:04,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540425320] [2022-11-20 10:44:04,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540425320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:44:04,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023410532] [2022-11-20 10:44:04,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:44:04,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:44:04,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:44:04,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:44:04,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:44:04,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:44:04,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:04,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:44:04,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:44:05,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:44:05,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023410532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:05,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:44:05,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2022-11-20 10:44:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299138779] [2022-11-20 10:44:05,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:05,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 10:44:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:44:05,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 10:44:05,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 10:44:05,459 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 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) [2022-11-20 10:44:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:06,196 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2022-11-20 10:44:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 10:44:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 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 47 [2022-11-20 10:44:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:06,199 INFO L225 Difference]: With dead ends: 379 [2022-11-20 10:44:06,199 INFO L226 Difference]: Without dead ends: 379 [2022-11-20 10:44:06,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1190, Invalid=1890, Unknown=0, NotChecked=0, Total=3080 [2022-11-20 10:44:06,202 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1124 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:06,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 219 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:44:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-20 10:44:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 140. [2022-11-20 10:44:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.125925925925926) internal successors, (152), 139 states have internal predecessors, (152), 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) [2022-11-20 10:44:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2022-11-20 10:44:06,218 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 47 [2022-11-20 10:44:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:06,219 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2022-11-20 10:44:06,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 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) [2022-11-20 10:44:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2022-11-20 10:44:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 10:44:06,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:06,228 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:06,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:06,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 10:44:06,434 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:44:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1050815861, now seen corresponding path program 3 times [2022-11-20 10:44:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:44:06,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374610750] [2022-11-20 10:44:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:44:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:44:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:44:07,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374610750] [2022-11-20 10:44:07,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374610750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:44:07,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791993407] [2022-11-20 10:44:07,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:44:07,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:44:07,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:44:07,531 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:44:07,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:44:07,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:44:07,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:07,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 10:44:07,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:07,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:44:07,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 10:44:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-11-20 10:44:09,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-11-20 10:44:10,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791993407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:10,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:44:10,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 42 [2022-11-20 10:44:10,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812547428] [2022-11-20 10:44:10,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:10,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 10:44:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:44:10,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 10:44:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=1204, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 10:44:10,859 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 42 states have internal predecessors, (118), 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) [2022-11-20 10:44:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:16,162 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2022-11-20 10:44:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-11-20 10:44:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 42 states have internal predecessors, (118), 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 89 [2022-11-20 10:44:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:16,164 INFO L225 Difference]: With dead ends: 143 [2022-11-20 10:44:16,164 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 10:44:16,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4323 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4457, Invalid=10549, Unknown=0, NotChecked=0, Total=15006 [2022-11-20 10:44:16,168 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:16,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 175 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-11-20 10:44:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 10:44:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-20 10:44:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.108695652173913) internal successors, (153), 142 states have internal predecessors, (153), 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) [2022-11-20 10:44:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2022-11-20 10:44:16,172 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 89 [2022-11-20 10:44:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:16,173 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2022-11-20 10:44:16,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 42 states have internal predecessors, (118), 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) [2022-11-20 10:44:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2022-11-20 10:44:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-20 10:44:16,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:16,174 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:16,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:16,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:44:16,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:44:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1593650031, now seen corresponding path program 4 times [2022-11-20 10:44:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:44:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318178507] [2022-11-20 10:44:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:44:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:44:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:44:17,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318178507] [2022-11-20 10:44:17,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318178507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:44:17,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675971236] [2022-11-20 10:44:17,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:44:17,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:44:17,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:44:17,469 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:44:17,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:44:18,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:44:18,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:18,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 10:44:18,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:44:19,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:44:20,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675971236] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:20,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:44:20,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 88 [2022-11-20 10:44:20,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253062786] [2022-11-20 10:44:20,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:20,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-20 10:44:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:44:20,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-20 10:44:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=4289, Unknown=0, NotChecked=0, Total=7656 [2022-11-20 10:44:20,854 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 88 states, 88 states have (on average 2.9431818181818183) internal successors, (259), 88 states have internal predecessors, (259), 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) [2022-11-20 10:44:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:23,513 INFO L93 Difference]: Finished difference Result 812 states and 813 transitions. [2022-11-20 10:44:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 10:44:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 2.9431818181818183) internal successors, (259), 88 states have internal predecessors, (259), 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 98 [2022-11-20 10:44:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:23,517 INFO L225 Difference]: With dead ends: 812 [2022-11-20 10:44:23,517 INFO L226 Difference]: Without dead ends: 812 [2022-11-20 10:44:23,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4757 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5075, Invalid=8265, Unknown=0, NotChecked=0, Total=13340 [2022-11-20 10:44:23,520 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3503 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3503 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:23,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3503 Valid, 488 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:44:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-20 10:44:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 275. [2022-11-20 10:44:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 270 states have (on average 1.1111111111111112) internal successors, (300), 274 states have internal predecessors, (300), 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) [2022-11-20 10:44:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 300 transitions. [2022-11-20 10:44:23,529 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 300 transitions. Word has length 98 [2022-11-20 10:44:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:23,530 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 300 transitions. [2022-11-20 10:44:23,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 2.9431818181818183) internal successors, (259), 88 states have internal predecessors, (259), 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) [2022-11-20 10:44:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2022-11-20 10:44:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-20 10:44:23,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:23,533 INFO L195 NwaCegarLoop]: trace histogram [56, 56, 56, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:23,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:23,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:44:23,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:44:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 597463893, now seen corresponding path program 5 times [2022-11-20 10:44:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:44:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065968939] [2022-11-20 10:44:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:44:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4691 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:44:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:44:27,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065968939] [2022-11-20 10:44:27,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065968939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:44:27,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138457720] [2022-11-20 10:44:27,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:44:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:44:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:44:27,343 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:44:27,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:47:18,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2022-11-20 10:47:18,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:47:18,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 10:47:18,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4691 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:47:20,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4691 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:47:25,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138457720] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:25,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:25,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 175 [2022-11-20 10:47:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880171320] [2022-11-20 10:47:25,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:25,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 175 states [2022-11-20 10:47:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2022-11-20 10:47:25,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13459, Invalid=16991, Unknown=0, NotChecked=0, Total=30450 [2022-11-20 10:47:25,414 INFO L87 Difference]: Start difference. First operand 275 states and 300 transitions. Second operand has 175 states, 175 states have (on average 2.9714285714285715) internal successors, (520), 175 states have internal predecessors, (520), 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) [2022-11-20 10:47:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:36,333 INFO L93 Difference]: Finished difference Result 1653 states and 1654 transitions. [2022-11-20 10:47:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-11-20 10:47:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 175 states, 175 states have (on average 2.9714285714285715) internal successors, (520), 175 states have internal predecessors, (520), 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 185 [2022-11-20 10:47:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:36,340 INFO L225 Difference]: With dead ends: 1653 [2022-11-20 10:47:36,340 INFO L226 Difference]: Without dead ends: 1653 [2022-11-20 10:47:36,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19605 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=20242, Invalid=33350, Unknown=0, NotChecked=0, Total=53592 [2022-11-20 10:47:36,346 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7647 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7647 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:36,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7647 Valid, 851 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 10:47:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-11-20 10:47:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 536. [2022-11-20 10:47:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 531 states have (on average 1.1111111111111112) internal successors, (590), 535 states have internal predecessors, (590), 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) [2022-11-20 10:47:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 590 transitions. [2022-11-20 10:47:36,362 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 590 transitions. Word has length 185 [2022-11-20 10:47:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:36,363 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 590 transitions. [2022-11-20 10:47:36,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 175 states, 175 states have (on average 2.9714285714285715) internal successors, (520), 175 states have internal predecessors, (520), 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) [2022-11-20 10:47:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 590 transitions. [2022-11-20 10:47:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-11-20 10:47:36,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:36,369 INFO L195 NwaCegarLoop]: trace histogram [114, 114, 114, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:36,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:36,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:47:36,592 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:47:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash 812449301, now seen corresponding path program 6 times [2022-11-20 10:47:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:36,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874353989] [2022-11-20 10:47:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19452 backedges. 0 proven. 19437 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:47:48,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:48,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874353989] [2022-11-20 10:47:48,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874353989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:48,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454046030] [2022-11-20 10:47:48,302 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:47:48,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:48,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:48,303 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:48,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:47:48,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-20 10:47:48,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:47:48,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 10:47:48,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:48,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:47:48,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 10:47:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 19452 backedges. 8 proven. 227 refuted. 0 times theorem prover too weak. 19217 trivial. 0 not checked. [2022-11-20 10:47:57,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19452 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 19217 trivial. 0 not checked. [2022-11-20 10:48:01,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454046030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:48:01,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:48:01,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 8, 8] total 132 [2022-11-20 10:48:01,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029138249] [2022-11-20 10:48:01,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:01,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-11-20 10:48:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-11-20 10:48:01,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7090, Invalid=10202, Unknown=0, NotChecked=0, Total=17292 [2022-11-20 10:48:01,732 INFO L87 Difference]: Start difference. First operand 536 states and 590 transitions. Second operand has 132 states, 132 states have (on average 2.9242424242424243) internal successors, (386), 132 states have internal predecessors, (386), 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) [2022-11-20 10:48:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:59,608 INFO L93 Difference]: Finished difference Result 538 states and 539 transitions. [2022-11-20 10:48:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2022-11-20 10:48:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.9242424242424243) internal successors, (386), 132 states have internal predecessors, (386), 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 359 [2022-11-20 10:48:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:59,611 INFO L225 Difference]: With dead ends: 538 [2022-11-20 10:48:59,611 INFO L226 Difference]: Without dead ends: 538 [2022-11-20 10:48:59,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 475 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74834 ImplicationChecksByTransitivity, 62.8s TimeCoverageRelationStatistics Valid=69078, Invalid=157974, Unknown=0, NotChecked=0, Total=227052 [2022-11-20 10:48:59,625 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 119 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:59,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 165 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-11-20 10:48:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-20 10:48:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-11-20 10:48:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 534 states have (on average 1.0093632958801497) internal successors, (539), 537 states have internal predecessors, (539), 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) [2022-11-20 10:48:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 539 transitions. [2022-11-20 10:48:59,635 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 539 transitions. Word has length 359 [2022-11-20 10:48:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:59,636 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 539 transitions. [2022-11-20 10:48:59,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.9242424242424243) internal successors, (386), 132 states have internal predecessors, (386), 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) [2022-11-20 10:48:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 539 transitions. [2022-11-20 10:48:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-11-20 10:48:59,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:59,649 INFO L195 NwaCegarLoop]: trace histogram [115, 115, 115, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:59,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:59,854 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:48:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 550593099, now seen corresponding path program 1 times [2022-11-20 10:48:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:59,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559265499] [2022-11-20 10:48:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24625 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24625 trivial. 0 not checked. [2022-11-20 10:49:00,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:00,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559265499] [2022-11-20 10:49:00,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559265499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:00,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:00,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:00,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283110095] [2022-11-20 10:49:00,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:00,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:00,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:00,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:00,311 INFO L87 Difference]: Start difference. First operand 538 states and 539 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-11-20 10:49:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:00,322 INFO L93 Difference]: Finished difference Result 536 states and 537 transitions. [2022-11-20 10:49:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 528 [2022-11-20 10:49:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:00,326 INFO L225 Difference]: With dead ends: 536 [2022-11-20 10:49:00,326 INFO L226 Difference]: Without dead ends: 536 [2022-11-20 10:49:00,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:00,327 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:00,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-20 10:49:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-11-20 10:49:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 534 states have (on average 1.0056179775280898) internal successors, (537), 535 states have internal predecessors, (537), 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) [2022-11-20 10:49:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2022-11-20 10:49:00,336 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 528 [2022-11-20 10:49:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:00,337 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2022-11-20 10:49:00,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-11-20 10:49:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2022-11-20 10:49:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2022-11-20 10:49:00,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:00,341 INFO L195 NwaCegarLoop]: trace histogram [115, 115, 115, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:00,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:49:00,342 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:49:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash 838993805, now seen corresponding path program 1 times [2022-11-20 10:49:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:00,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763189690] [2022-11-20 10:49:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24625 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2022-11-20 10:49:12,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:12,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763189690] [2022-11-20 10:49:12,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763189690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:12,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941577691] [2022-11-20 10:49:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:12,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:12,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:12,943 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:12,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:49:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:13,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-20 10:49:13,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24625 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2022-11-20 10:49:21,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:49:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24625 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2022-11-20 10:49:29,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941577691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:49:29,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:49:29,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 248 [2022-11-20 10:49:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301803191] [2022-11-20 10:49:29,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:49:29,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 248 states [2022-11-20 10:49:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2022-11-20 10:49:29,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23819, Invalid=37437, Unknown=0, NotChecked=0, Total=61256 [2022-11-20 10:49:29,650 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand has 248 states, 248 states have (on average 3.0201612903225805) internal successors, (749), 248 states have internal predecessors, (749), 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) [2022-11-20 10:49:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:41,732 INFO L93 Difference]: Finished difference Result 928 states and 929 transitions. [2022-11-20 10:49:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-20 10:49:41,733 INFO L78 Accepts]: Start accepts. Automaton has has 248 states, 248 states have (on average 3.0201612903225805) internal successors, (749), 248 states have internal predecessors, (749), 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 530 [2022-11-20 10:49:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:41,736 INFO L225 Difference]: With dead ends: 928 [2022-11-20 10:49:41,737 INFO L226 Difference]: Without dead ends: 928 [2022-11-20 10:49:41,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 827 SyntacticMatches, 104 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56837 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=25415, Invalid=41925, Unknown=0, NotChecked=0, Total=67340 [2022-11-20 10:49:41,741 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3545 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3545 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:41,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3545 Valid, 230 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 10:49:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-11-20 10:49:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 752. [2022-11-20 10:49:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 750 states have (on average 1.004) internal successors, (753), 751 states have internal predecessors, (753), 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) [2022-11-20 10:49:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 753 transitions. [2022-11-20 10:49:41,756 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 753 transitions. Word has length 530 [2022-11-20 10:49:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:41,756 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 753 transitions. [2022-11-20 10:49:41,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 248 states, 248 states have (on average 3.0201612903225805) internal successors, (749), 248 states have internal predecessors, (749), 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) [2022-11-20 10:49:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 753 transitions. [2022-11-20 10:49:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-11-20 10:49:41,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:41,763 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:41,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:41,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:41,971 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:49:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1155227950, now seen corresponding path program 2 times [2022-11-20 10:49:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:41,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495596010] [2022-11-20 10:49:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 44638 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2022-11-20 10:49:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495596010] [2022-11-20 10:49:56,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495596010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487199247] [2022-11-20 10:49:56,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:49:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:56,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:56,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:49:57,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:49:57,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:49:57,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-20 10:49:57,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 44638 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2022-11-20 10:49:57,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:50:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44638 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2022-11-20 10:50:04,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487199247] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:50:04,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:50:04,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 130 [2022-11-20 10:50:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228680564] [2022-11-20 10:50:04,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:50:04,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-11-20 10:50:04,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:50:04,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-11-20 10:50:04,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2022-11-20 10:50:04,811 INFO L87 Difference]: Start difference. First operand 752 states and 753 transitions. Second operand has 130 states, 130 states have (on average 3.0846153846153848) internal successors, (401), 130 states have internal predecessors, (401), 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) [2022-11-20 10:50:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:50:09,660 INFO L93 Difference]: Finished difference Result 785 states and 786 transitions. [2022-11-20 10:50:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-11-20 10:50:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 3.0846153846153848) internal successors, (401), 130 states have internal predecessors, (401), 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 746 [2022-11-20 10:50:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:50:09,664 INFO L225 Difference]: With dead ends: 785 [2022-11-20 10:50:09,664 INFO L226 Difference]: Without dead ends: 785 [2022-11-20 10:50:09,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1609 GetRequests, 1374 SyntacticMatches, 107 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7205 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2022-11-20 10:50:09,668 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1394 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:50:09,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 124 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 10:50:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-11-20 10:50:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2022-11-20 10:50:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 783 states have (on average 1.003831417624521) internal successors, (786), 784 states have internal predecessors, (786), 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) [2022-11-20 10:50:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 786 transitions. [2022-11-20 10:50:09,697 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 786 transitions. Word has length 746 [2022-11-20 10:50:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:50:09,698 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 786 transitions. [2022-11-20 10:50:09,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 3.0846153846153848) internal successors, (401), 130 states have internal predecessors, (401), 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) [2022-11-20 10:50:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 786 transitions. [2022-11-20 10:50:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2022-11-20 10:50:09,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:50:09,705 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:50:09,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:50:09,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:50:09,918 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:50:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1022501805, now seen corresponding path program 3 times [2022-11-20 10:50:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:50:09,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806374455] [2022-11-20 10:50:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:50:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:50:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:50:10,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:50:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:50:12,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:50:12,030 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:50:12,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (20 of 21 remaining) [2022-11-20 10:50:12,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-11-20 10:50:12,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-11-20 10:50:12,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-11-20 10:50:12,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-11-20 10:50:12,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-11-20 10:50:12,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-11-20 10:50:12,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-11-20 10:50:12,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-11-20 10:50:12,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2022-11-20 10:50:12,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2022-11-20 10:50:12,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2022-11-20 10:50:12,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2022-11-20 10:50:12,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2022-11-20 10:50:12,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2022-11-20 10:50:12,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-11-20 10:50:12,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-11-20 10:50:12,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-11-20 10:50:12,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-11-20 10:50:12,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-11-20 10:50:12,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-11-20 10:50:12,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:50:12,044 INFO L444 BasicCegarLoop]: Path program histogram: [6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:50:12,050 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:50:12,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:50:12 BoogieIcfgContainer [2022-11-20 10:50:12,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:50:12,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:50:12,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:50:12,302 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:50:12,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:43:53" (3/4) ... [2022-11-20 10:50:12,311 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:50:12,533 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:50:12,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:50:12,535 INFO L158 Benchmark]: Toolchain (without parser) took 380564.95ms. Allocated memory was 176.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 103.2MB in the beginning and 682.9MB in the end (delta: -579.7MB). Peak memory consumption was 888.4MB. Max. memory is 16.1GB. [2022-11-20 10:50:12,536 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 176.2MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:50:12,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.31ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 134.2MB in the end (delta: -31.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 10:50:12,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.72ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 132.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:50:12,538 INFO L158 Benchmark]: Boogie Preprocessor took 43.35ms. Allocated memory is still 176.2MB. Free memory was 132.7MB in the beginning and 131.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:50:12,541 INFO L158 Benchmark]: RCFGBuilder took 447.60ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 117.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 10:50:12,543 INFO L158 Benchmark]: TraceAbstraction took 379250.49ms. Allocated memory was 176.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 116.9MB in the beginning and 718.5MB in the end (delta: -601.6MB). Peak memory consumption was 866.4MB. Max. memory is 16.1GB. [2022-11-20 10:50:12,543 INFO L158 Benchmark]: Witness Printer took 233.22ms. Allocated memory is still 1.6GB. Free memory was 718.5MB in the beginning and 682.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-20 10:50:12,545 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.27ms. Allocated memory is still 176.2MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.31ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 134.2MB in the end (delta: -31.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.72ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 132.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.35ms. Allocated memory is still 176.2MB. Free memory was 132.7MB in the beginning and 131.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.60ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 117.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 379250.49ms. Allocated memory was 176.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 116.9MB in the beginning and 718.5MB in the end (delta: -601.6MB). Peak memory consumption was 866.4MB. Max. memory is 16.1GB. * Witness Printer took 233.22ms. Allocated memory is still 1.6GB. Free memory was 718.5MB in the beginning and 682.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 543]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L535] n = 128 [L536] a = malloc (n * sizeof(*a)) [L537] b = malloc (n * sizeof(*b)) [L538] EXPR b++ VAL [a={-2:0}, b={-3:4}, b++={-3:0}, n=128] [L538] *b++ = 0 VAL [a={-2:0}, b={-3:4}, b++={-3:0}, n=128] [L539] CALL foo () [L527] int i; [L528] i = 0 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=128, n=128] [L528] COND FALSE !(i < n) VAL [a={-2:0}, b={-3:4}, i=128, n=128] [L530] i = 0 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L530] COND FALSE !(i < 128 - 1) VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L539] RET foo () [L540] b[-1] VAL [a={-2:0}, b={-3:4}, b[-1]=0, n=128] [L540] COND FALSE !(b[-1]) [L543] free(a) VAL [a={-2:0}, b={-3:4}, n=128] [L543] free(a) VAL [a={-2:0}, b={-3:4}, n=128] [L543] free(a) [L543] free(b) VAL [a={-2:0}, b={-3:4}, n=128] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 378.9s, OverallIterations: 21, TraceHistogramMax: 128, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 98.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18851 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18851 mSDsluCounter, 3262 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 92 IncrementalHoareTripleChecker+Unchecked, 2765 mSDsCounter, 2865 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6415 IncrementalHoareTripleChecker+Invalid, 9372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2865 mSolverCounterUnsat, 497 mSDtfsCounter, 6415 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5439 GetRequests, 3706 SyntacticMatches, 211 SemanticMatches, 1522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169288 ImplicationChecksByTransitivity, 121.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=20, InterpolantAutomatonStates: 994, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 2138 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 174.6s SatisfiabilityAnalysisTime, 99.2s InterpolantComputationTime, 5686 NumberOfCodeBlocks, 5230 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 7013 ConstructedInterpolants, 22 QuantifiedInterpolants, 49017 SizeOfPredicates, 47 NumberOfNonLiveVariables, 6909 ConjunctsInSsa, 457 ConjunctsInUnsatCore, 45 InterpolantComputations, 8 PerfectInterpolantSequences, 153451/312442 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:50:12,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bab22aa-619d-46bc-84e3-2d690ae8c62b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)