./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/960521-1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:29:59,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:29:59,479 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:29:59,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:29:59,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:29:59,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:29:59,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:29:59,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:29:59,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:29:59,535 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:29:59,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:29:59,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:29:59,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:29:59,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:29:59,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:29:59,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:29:59,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:29:59,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:29:59,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:29:59,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:29:59,539 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:29:59,539 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:29:59,539 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:29:59,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:29:59,539 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:29:59,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:29:59,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:29:59,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:29:59,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:29:59,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:29:59,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:29:59,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:29:59,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:29:59,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:29:59,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:29:59,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:29:59,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:29:59,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:29:59,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:29:59,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:29:59,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:29:59,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:29:59,542 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2024-11-13 15:29:59,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:29:59,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:29:59,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:29:59,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:29:59,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:29:59,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety/960521-1-1.i Unable to find full path for "g++" [2024-11-13 15:30:01,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:30:02,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:30:02,085 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/sv-benchmarks/c/memsafety/960521-1-1.i [2024-11-13 15:30:02,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/data/15e809181/3d2cbc88ffcc4c14b10c10317d51351d/FLAG7a486c95f [2024-11-13 15:30:02,115 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/data/15e809181/3d2cbc88ffcc4c14b10c10317d51351d [2024-11-13 15:30:02,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:30:02,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:30:02,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:30:02,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:30:02,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:30:02,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9b998d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02, skipping insertion in model container [2024-11-13 15:30:02,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:30:02,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:30:02,502 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:30:02,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:30:02,574 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:30:02,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02 WrapperNode [2024-11-13 15:30:02,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:30:02,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:30:02,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:30:02,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:30:02,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,632 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-13 15:30:02,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:30:02,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:30:02,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:30:02,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:30:02,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,675 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-13 15:30:02,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:30:02,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:30:02,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:30:02,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:30:02,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (1/1) ... [2024-11-13 15:30:02,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:30:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:02,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:30:02,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:30:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:30:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:30:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:30:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:30:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:30:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:30:02,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:30:02,924 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:30:02,926 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:30:03,167 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 15:30:03,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:30:03,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:30:03,180 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 15:30:03,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:30:03 BoogieIcfgContainer [2024-11-13 15:30:03,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:30:03,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:30:03,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:30:03,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:30:03,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:30:02" (1/3) ... [2024-11-13 15:30:03,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a139d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:30:03, skipping insertion in model container [2024-11-13 15:30:03,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:02" (2/3) ... [2024-11-13 15:30:03,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a139d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:30:03, skipping insertion in model container [2024-11-13 15:30:03,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:30:03" (3/3) ... [2024-11-13 15:30:03,191 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1-1.i [2024-11-13 15:30:03,212 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:30:03,215 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1-1.i that has 1 procedures, 51 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2024-11-13 15:30:03,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:30:03,280 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@547c4815, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:30:03,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-13 15:30:03,289 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) [2024-11-13 15:30:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 15:30:03,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:03,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 15:30:03,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:03,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:03,305 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-13 15:30:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:03,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446597470] [2024-11-13 15:30:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:03,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446597470] [2024-11-13 15:30:03,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446597470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:03,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:03,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:30:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855270267] [2024-11-13 15:30:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:03,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:30:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:30:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:30:03,632 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) [2024-11-13 15:30:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:03,724 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-11-13 15:30:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:30:03,726 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 [2024-11-13 15:30:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:03,734 INFO L225 Difference]: With dead ends: 50 [2024-11-13 15:30:03,734 INFO L226 Difference]: Without dead ends: 48 [2024-11-13 15:30:03,737 INFO L431 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 [2024-11-13 15:30:03,741 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:03,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:30:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-13 15:30:03,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-13 15:30:03,808 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) [2024-11-13 15:30:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-11-13 15:30:03,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2024-11-13 15:30:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:03,817 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-11-13 15:30:03,818 INFO L472 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) [2024-11-13 15:30:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-11-13 15:30:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 15:30:03,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:03,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 15:30:03,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:30:03,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-13 15:30:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633574591] [2024-11-13 15:30:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633574591] [2024-11-13 15:30:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633574591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:04,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:04,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:30:04,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361512037] [2024-11-13 15:30:04,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:04,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:30:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:04,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:30:04,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:30:04,062 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) [2024-11-13 15:30:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:04,097 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-11-13 15:30:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:30:04,099 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 [2024-11-13 15:30:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:04,100 INFO L225 Difference]: With dead ends: 47 [2024-11-13 15:30:04,101 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 15:30:04,101 INFO L431 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 [2024-11-13 15:30:04,102 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:04,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:30:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 15:30:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-13 15:30:04,111 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) [2024-11-13 15:30:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-11-13 15:30:04,112 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2024-11-13 15:30:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:04,112 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-11-13 15:30:04,113 INFO L472 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) [2024-11-13 15:30:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-11-13 15:30:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:30:04,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:04,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:30:04,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:30:04,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:04,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:04,116 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2024-11-13 15:30:04,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:04,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404612474] [2024-11-13 15:30:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:04,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404612474] [2024-11-13 15:30:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404612474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:04,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:30:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355164422] [2024-11-13 15:30:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:04,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:30:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:04,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:30:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:30:04,328 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) [2024-11-13 15:30:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:04,429 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2024-11-13 15:30:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:30:04,431 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 [2024-11-13 15:30:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:04,431 INFO L225 Difference]: With dead ends: 44 [2024-11-13 15:30:04,432 INFO L226 Difference]: Without dead ends: 44 [2024-11-13 15:30:04,432 INFO L431 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 [2024-11-13 15:30:04,433 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:04,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:30:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-13 15:30:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-13 15:30:04,440 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) [2024-11-13 15:30:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-11-13 15:30:04,443 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2024-11-13 15:30:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:04,444 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-11-13 15:30:04,444 INFO L472 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) [2024-11-13 15:30:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-11-13 15:30:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:30:04,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:04,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:30:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:30:04,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:04,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2024-11-13 15:30:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:04,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489196757] [2024-11-13 15:30:04,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:04,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:04,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489196757] [2024-11-13 15:30:04,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489196757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:04,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:04,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:30:04,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347687814] [2024-11-13 15:30:04,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:04,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:30:04,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:04,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:30:04,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:30:04,887 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) [2024-11-13 15:30:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:05,090 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-13 15:30:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:30:05,093 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 [2024-11-13 15:30:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:05,093 INFO L225 Difference]: With dead ends: 49 [2024-11-13 15:30:05,094 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 15:30:05,094 INFO L431 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 [2024-11-13 15:30:05,096 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:05,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 63 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:30:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 15:30:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-13 15:30:05,105 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) [2024-11-13 15:30:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-13 15:30:05,105 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 6 [2024-11-13 15:30:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:05,106 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-13 15:30:05,106 INFO L472 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) [2024-11-13 15:30:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-13 15:30:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 15:30:05,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:05,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:05,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:30:05,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:05,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash 59361074, now seen corresponding path program 1 times [2024-11-13 15:30:05,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:05,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180515478] [2024-11-13 15:30:05,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180515478] [2024-11-13 15:30:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180515478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:05,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:30:05,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684863673] [2024-11-13 15:30:05,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:05,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:30:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:30:05,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:30:05,204 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) [2024-11-13 15:30:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:05,254 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-13 15:30:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:30:05,256 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 [2024-11-13 15:30:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:05,258 INFO L225 Difference]: With dead ends: 49 [2024-11-13 15:30:05,258 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 15:30:05,258 INFO L431 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 [2024-11-13 15:30:05,259 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 47 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:05,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 65 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:30:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 15:30:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-13 15:30:05,265 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) [2024-11-13 15:30:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2024-11-13 15:30:05,266 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 8 [2024-11-13 15:30:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:05,268 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2024-11-13 15:30:05,269 INFO L472 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) [2024-11-13 15:30:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2024-11-13 15:30:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 15:30:05,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:05,269 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:05,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:30:05,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:05,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1841819726, now seen corresponding path program 1 times [2024-11-13 15:30:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:05,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204489178] [2024-11-13 15:30:05,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:05,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204489178] [2024-11-13 15:30:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204489178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974321076] [2024-11-13 15:30:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:05,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:05,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:05,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:05,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:30:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:06,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 15:30:06,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:06,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:30:06,142 INFO L378 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 13 treesize of output 1 [2024-11-13 15:30:06,159 INFO L378 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 [2024-11-13 15:30:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:06,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974321076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:06,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-13 15:30:06,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853588489] [2024-11-13 15:30:06,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:06,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:30:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:06,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:30:06,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:30:06,868 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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) [2024-11-13 15:30:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:07,418 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-13 15:30:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:30:07,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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 [2024-11-13 15:30:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:07,420 INFO L225 Difference]: With dead ends: 62 [2024-11-13 15:30:07,420 INFO L226 Difference]: Without dead ends: 62 [2024-11-13 15:30:07,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-13 15:30:07,421 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 143 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:07,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 104 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:30:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-13 15:30:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2024-11-13 15:30:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 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) [2024-11-13 15:30:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-11-13 15:30:07,426 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 9 [2024-11-13 15:30:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:07,426 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-11-13 15:30:07,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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) [2024-11-13 15:30:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-11-13 15:30:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:30:07,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:07,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:07,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:30:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 15:30:07,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:07,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash 462176919, now seen corresponding path program 1 times [2024-11-13 15:30:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022947474] [2024-11-13 15:30:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:30:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022947474] [2024-11-13 15:30:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022947474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:07,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:30:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720107840] [2024-11-13 15:30:07,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:07,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:30:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:30:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:30:07,706 INFO L87 Difference]: Start difference. First operand 57 states and 64 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) [2024-11-13 15:30:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:07,772 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-13 15:30:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:30:07,772 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 [2024-11-13 15:30:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:07,773 INFO L225 Difference]: With dead ends: 55 [2024-11-13 15:30:07,773 INFO L226 Difference]: Without dead ends: 55 [2024-11-13 15:30:07,773 INFO L431 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 [2024-11-13 15:30:07,774 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:07,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 61 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:30:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-13 15:30:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-13 15:30:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 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) [2024-11-13 15:30:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-13 15:30:07,780 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2024-11-13 15:30:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:07,781 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-13 15:30:07,781 INFO L472 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) [2024-11-13 15:30:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-13 15:30:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:30:07,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:07,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:07,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:30:07,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:07,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:07,786 INFO L85 PathProgramCache]: Analyzing trace with hash 462176920, now seen corresponding path program 1 times [2024-11-13 15:30:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:07,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042081630] [2024-11-13 15:30:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:07,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042081630] [2024-11-13 15:30:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042081630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908129112] [2024-11-13 15:30:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:07,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:07,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:07,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:07,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:30:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:07,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:30:07,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:08,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:08,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908129112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:08,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:08,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 15:30:08,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156810876] [2024-11-13 15:30:08,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:08,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:30:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:08,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:30:08,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:30:08,078 INFO L87 Difference]: Start difference. First operand 55 states and 61 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) [2024-11-13 15:30:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:08,209 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-13 15:30:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:30:08,210 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 [2024-11-13 15:30:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:08,211 INFO L225 Difference]: With dead ends: 58 [2024-11-13 15:30:08,211 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 15:30:08,211 INFO L431 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 [2024-11-13 15:30:08,212 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 117 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:08,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 86 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:30:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 15:30:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2024-11-13 15:30:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-11-13 15:30:08,218 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 11 [2024-11-13 15:30:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:08,219 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-11-13 15:30:08,219 INFO L472 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) [2024-11-13 15:30:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-11-13 15:30:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 15:30:08,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:08,222 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2024-11-13 15:30:08,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:30:08,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 15:30:08,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:08,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash -703267991, now seen corresponding path program 2 times [2024-11-13 15:30:08,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:08,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674876050] [2024-11-13 15:30:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:08,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:09,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:09,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674876050] [2024-11-13 15:30:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674876050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808534647] [2024-11-13 15:30:09,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:30:09,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:09,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:09,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:09,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:30:09,172 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:30:09,172 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:30:09,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 15:30:09,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:09,201 INFO L378 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 [2024-11-13 15:30:09,225 INFO L378 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 11 treesize of output 5 [2024-11-13 15:30:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:10,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808534647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:10,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:10,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-13 15:30:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530552384] [2024-11-13 15:30:10,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:10,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 15:30:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:10,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 15:30:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-11-13 15:30:10,762 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 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) [2024-11-13 15:30:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:11,614 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2024-11-13 15:30:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:30:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 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 [2024-11-13 15:30:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:11,615 INFO L225 Difference]: With dead ends: 71 [2024-11-13 15:30:11,616 INFO L226 Difference]: Without dead ends: 71 [2024-11-13 15:30:11,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 15:30:11,617 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 215 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:11,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 136 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:30:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-13 15:30:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2024-11-13 15:30:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 52 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) [2024-11-13 15:30:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-13 15:30:11,624 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 18 [2024-11-13 15:30:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:11,624 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-13 15:30:11,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 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) [2024-11-13 15:30:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-11-13 15:30:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 15:30:11,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:11,625 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:11,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:30:11,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 15:30:11,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1530727693, now seen corresponding path program 2 times [2024-11-13 15:30:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220223157] [2024-11-13 15:30:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:11,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220223157] [2024-11-13 15:30:11,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220223157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:11,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15314303] [2024-11-13 15:30:11,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:30:11,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:11,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:11,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:11,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:30:12,012 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 15:30:12,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:30:12,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 15:30:12,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:12,030 INFO L378 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 11 treesize of output 5 [2024-11-13 15:30:12,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:30:12,039 INFO L378 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 6 treesize of output 1 [2024-11-13 15:30:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 15:30:12,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:30:12,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15314303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:12,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:30:12,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-13 15:30:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312118976] [2024-11-13 15:30:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:12,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:30:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:12,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:30:12,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:30:12,174 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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) [2024-11-13 15:30:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:12,229 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-13 15:30:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:30:12,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 [2024-11-13 15:30:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:12,230 INFO L225 Difference]: With dead ends: 41 [2024-11-13 15:30:12,230 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 15:30:12,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:30:12,231 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:12,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:30:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 15:30:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-13 15:30:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 40 states have internal predecessors, (42), 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) [2024-11-13 15:30:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-13 15:30:12,234 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 20 [2024-11-13 15:30:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:12,234 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-13 15:30:12,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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) [2024-11-13 15:30:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-13 15:30:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:30:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:12,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:12,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:30:12,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 15:30:12,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2054020820, now seen corresponding path program 1 times [2024-11-13 15:30:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739814009] [2024-11-13 15:30:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:30:12,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:12,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739814009] [2024-11-13 15:30:12,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739814009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:12,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114802908] [2024-11-13 15:30:12,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:12,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:12,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:12,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:30:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:12,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:30:12,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:30:12,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:30:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114802908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:12,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-13 15:30:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642914559] [2024-11-13 15:30:12,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:12,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:30:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:12,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:30:12,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:30:12,928 INFO L87 Difference]: Start difference. First operand 41 states and 42 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) [2024-11-13 15:30:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:13,166 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2024-11-13 15:30:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:30:13,166 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 [2024-11-13 15:30:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:13,168 INFO L225 Difference]: With dead ends: 80 [2024-11-13 15:30:13,168 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 15:30:13,168 INFO L431 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 [2024-11-13 15:30:13,169 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 173 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:13,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 89 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:30:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 15:30:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2024-11-13 15:30:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 67 states have internal predecessors, (72), 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) [2024-11-13 15:30:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-13 15:30:13,180 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2024-11-13 15:30:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-13 15:30:13,181 INFO L472 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) [2024-11-13 15:30:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-13 15:30:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 15:30:13,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:13,181 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:13,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:30:13,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:13,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:13,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -166689484, now seen corresponding path program 2 times [2024-11-13 15:30:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:13,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410157291] [2024-11-13 15:30:13,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:13,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:30:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:13,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410157291] [2024-11-13 15:30:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410157291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181320802] [2024-11-13 15:30:13,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:30:13,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:13,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:13,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:30:13,859 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:30:13,859 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:30:13,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 15:30:13,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:30:14,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:30:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181320802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:14,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2024-11-13 15:30:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498270563] [2024-11-13 15:30:14,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:14,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 15:30:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 15:30:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2024-11-13 15:30:14,499 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 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) [2024-11-13 15:30:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:15,099 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2024-11-13 15:30:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 15:30:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 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 41 [2024-11-13 15:30:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:15,102 INFO L225 Difference]: With dead ends: 152 [2024-11-13 15:30:15,103 INFO L226 Difference]: Without dead ends: 152 [2024-11-13 15:30:15,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2024-11-13 15:30:15,105 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 272 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:15,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 61 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:30:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-13 15:30:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2024-11-13 15:30:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.1282051282051282) internal successors, (132), 121 states have internal predecessors, (132), 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) [2024-11-13 15:30:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-11-13 15:30:15,121 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 41 [2024-11-13 15:30:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:15,121 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-11-13 15:30:15,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 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) [2024-11-13 15:30:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-11-13 15:30:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 15:30:15,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:15,123 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:15,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 15:30:15,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 15:30:15,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:15,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash 758204916, now seen corresponding path program 3 times [2024-11-13 15:30:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572151330] [2024-11-13 15:30:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:30:16,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572151330] [2024-11-13 15:30:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572151330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33029326] [2024-11-13 15:30:16,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:30:16,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:16,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:16,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:16,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:30:16,342 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 15:30:16,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:30:16,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 15:30:16,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:16,375 INFO L378 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 [2024-11-13 15:30:16,394 INFO L378 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 13 treesize of output 1 [2024-11-13 15:30:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-13 15:30:18,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-13 15:30:19,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33029326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:19,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:19,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 7, 7] total 38 [2024-11-13 15:30:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031234926] [2024-11-13 15:30:19,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:19,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 15:30:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 15:30:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 15:30:19,049 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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) [2024-11-13 15:30:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:30,356 INFO L93 Difference]: Finished difference Result 165 states and 197 transitions. [2024-11-13 15:30:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-13 15:30:30,356 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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 77 [2024-11-13 15:30:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:30,357 INFO L225 Difference]: With dead ends: 165 [2024-11-13 15:30:30,357 INFO L226 Difference]: Without dead ends: 165 [2024-11-13 15:30:30,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=4629, Invalid=11883, Unknown=0, NotChecked=0, Total=16512 [2024-11-13 15:30:30,363 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 636 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:30,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 27 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:30:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-13 15:30:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2024-11-13 15:30:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.1) internal successors, (132), 124 states have internal predecessors, (132), 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) [2024-11-13 15:30:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2024-11-13 15:30:30,369 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 77 [2024-11-13 15:30:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:30,370 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-11-13 15:30:30,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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) [2024-11-13 15:30:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-13 15:30:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 15:30:30,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:30,372 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:30,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:30:30,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:30,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -838102216, now seen corresponding path program 4 times [2024-11-13 15:30:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090884355] [2024-11-13 15:30:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:30:31,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090884355] [2024-11-13 15:30:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090884355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211236485] [2024-11-13 15:30:31,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 15:30:31,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:31,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:31,623 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:31,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:30:32,012 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 15:30:32,012 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:30:32,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 15:30:32,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:30:32,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:30:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211236485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:33,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 76 [2024-11-13 15:30:33,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202644335] [2024-11-13 15:30:33,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:33,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-13 15:30:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-13 15:30:33,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2503, Invalid=3197, Unknown=0, NotChecked=0, Total=5700 [2024-11-13 15:30:33,688 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 76 states, 76 states have (on average 2.9342105263157894) internal successors, (223), 76 states have internal predecessors, (223), 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) [2024-11-13 15:30:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:35,206 INFO L93 Difference]: Finished difference Result 308 states and 374 transitions. [2024-11-13 15:30:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-13 15:30:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.9342105263157894) internal successors, (223), 76 states have internal predecessors, (223), 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 [2024-11-13 15:30:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:35,208 INFO L225 Difference]: With dead ends: 308 [2024-11-13 15:30:35,208 INFO L226 Difference]: Without dead ends: 308 [2024-11-13 15:30:35,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3501 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3775, Invalid=6125, Unknown=0, NotChecked=0, Total=9900 [2024-11-13 15:30:35,211 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 620 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:35,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 89 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:30:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-13 15:30:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 239. [2024-11-13 15:30:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.106837606837607) internal successors, (259), 238 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) [2024-11-13 15:30:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2024-11-13 15:30:35,224 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 89 [2024-11-13 15:30:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:35,224 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2024-11-13 15:30:35,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 2.9342105263157894) internal successors, (223), 76 states have internal predecessors, (223), 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) [2024-11-13 15:30:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2024-11-13 15:30:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-13 15:30:35,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:35,233 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:35,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:30:35,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:35,434 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:30:35,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1753070835, now seen corresponding path program 5 times [2024-11-13 15:30:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:35,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337849383] [2024-11-13 15:30:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:30:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337849383] [2024-11-13 15:30:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337849383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470257316] [2024-11-13 15:30:38,437 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 15:30:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:38,439 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:38,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:34:16,587 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2024-11-13 15:34:16,587 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:34:16,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 15:34:16,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:34:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:34:18,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:34:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:34:22,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470257316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:34:22,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:34:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 151 [2024-11-13 15:34:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860401711] [2024-11-13 15:34:22,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:34:22,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 151 states [2024-11-13 15:34:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:34:22,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2024-11-13 15:34:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10003, Invalid=12647, Unknown=0, NotChecked=0, Total=22650 [2024-11-13 15:34:22,786 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand has 151 states, 151 states have (on average 2.966887417218543) internal successors, (448), 151 states have internal predecessors, (448), 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) [2024-11-13 15:34:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:34:29,529 INFO L93 Difference]: Finished difference Result 608 states and 749 transitions. [2024-11-13 15:34:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-11-13 15:34:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 151 states, 151 states have (on average 2.966887417218543) internal successors, (448), 151 states have internal predecessors, (448), 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 164 [2024-11-13 15:34:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:34:29,534 INFO L225 Difference]: With dead ends: 608 [2024-11-13 15:34:29,534 INFO L226 Difference]: Without dead ends: 608 [2024-11-13 15:34:29,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14501 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=15050, Invalid=24750, Unknown=0, NotChecked=0, Total=39800 [2024-11-13 15:34:29,542 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1395 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:34:29,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 89 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 15:34:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-13 15:34:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 464. [2024-11-13 15:34:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 459 states have (on average 1.1089324618736383) internal successors, (509), 463 states have internal predecessors, (509), 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) [2024-11-13 15:34:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 509 transitions. [2024-11-13 15:34:29,563 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 509 transitions. Word has length 164 [2024-11-13 15:34:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:34:29,564 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 509 transitions. [2024-11-13 15:34:29,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 151 states, 151 states have (on average 2.966887417218543) internal successors, (448), 151 states have internal predecessors, (448), 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) [2024-11-13 15:34:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 509 transitions. [2024-11-13 15:34:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-13 15:34:29,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:34:29,574 INFO L215 NwaCegarLoop]: trace histogram [98, 98, 98, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:34:29,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:34:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:34:29,775 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:34:29,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:34:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash 147047379, now seen corresponding path program 6 times [2024-11-13 15:34:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:34:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252501653] [2024-11-13 15:34:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:34:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14383 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:34:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:34:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252501653] [2024-11-13 15:34:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252501653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:34:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94883241] [2024-11-13 15:34:40,664 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 15:34:40,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:34:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:34:40,667 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:34:40,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:34:40,877 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-13 15:34:40,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:34:40,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 15:34:40,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:34:40,896 INFO L378 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 11 treesize of output 5 [2024-11-13 15:34:40,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:34:40,906 INFO L378 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 6 treesize of output 1 [2024-11-13 15:34:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14383 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14372 trivial. 0 not checked. [2024-11-13 15:34:42,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:34:42,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94883241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:34:42,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:34:42,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [102] total 106 [2024-11-13 15:34:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110978942] [2024-11-13 15:34:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:34:42,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:34:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:34:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:34:42,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5067, Invalid=6063, Unknown=0, NotChecked=0, Total=11130 [2024-11-13 15:34:42,669 INFO L87 Difference]: Start difference. First operand 464 states and 509 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2024-11-13 15:34:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:34:42,723 INFO L93 Difference]: Finished difference Result 463 states and 464 transitions. [2024-11-13 15:34:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:34:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 314 [2024-11-13 15:34:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:34:42,726 INFO L225 Difference]: With dead ends: 463 [2024-11-13 15:34:42,726 INFO L226 Difference]: Without dead ends: 463 [2024-11-13 15:34:42,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5067, Invalid=6063, Unknown=0, NotChecked=0, Total=11130 [2024-11-13 15:34:42,729 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:34:42,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:34:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-13 15:34:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-11-13 15:34:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 459 states have (on average 1.0108932461873639) internal successors, (464), 462 states have internal predecessors, (464), 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) [2024-11-13 15:34:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2024-11-13 15:34:42,743 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 314 [2024-11-13 15:34:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:34:42,744 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2024-11-13 15:34:42,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2024-11-13 15:34:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2024-11-13 15:34:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2024-11-13 15:34:42,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:34:42,755 INFO L215 NwaCegarLoop]: trace histogram [98, 98, 98, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:34:42,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 15:34:42,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 15:34:42,956 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:34:42,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:34:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 249122735, now seen corresponding path program 1 times [2024-11-13 15:34:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:34:42,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710038579] [2024-11-13 15:34:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:34:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17934 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17934 trivial. 0 not checked. [2024-11-13 15:34:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:34:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710038579] [2024-11-13 15:34:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710038579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:34:43,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:34:43,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:34:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564077845] [2024-11-13 15:34:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:34:43,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:34:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:34:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:34:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:34:43,545 INFO L87 Difference]: Start difference. First operand 463 states and 464 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) [2024-11-13 15:34:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:34:43,566 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2024-11-13 15:34:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:34:43,567 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 453 [2024-11-13 15:34:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:34:43,569 INFO L225 Difference]: With dead ends: 461 [2024-11-13 15:34:43,570 INFO L226 Difference]: Without dead ends: 461 [2024-11-13 15:34:43,570 INFO L431 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 [2024-11-13 15:34:43,571 INFO L432 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 [2024-11-13 15:34:43,571 INFO L433 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] [2024-11-13 15:34:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-13 15:34:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-11-13 15:34:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 459 states have (on average 1.0065359477124183) internal successors, (462), 460 states have internal predecessors, (462), 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) [2024-11-13 15:34:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 462 transitions. [2024-11-13 15:34:43,583 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 462 transitions. Word has length 453 [2024-11-13 15:34:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:34:43,585 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 462 transitions. [2024-11-13 15:34:43,585 INFO L472 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) [2024-11-13 15:34:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 462 transitions. [2024-11-13 15:34:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-13 15:34:43,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:34:43,588 INFO L215 NwaCegarLoop]: trace histogram [98, 98, 98, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:34:43,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:34:43,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:34:43,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:34:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1111217231, now seen corresponding path program 1 times [2024-11-13 15:34:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:34:43,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073839538] [2024-11-13 15:34:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:34:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17934 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2024-11-13 15:34:55,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:34:55,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073839538] [2024-11-13 15:34:55,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073839538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:34:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710856435] [2024-11-13 15:34:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:55,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:34:55,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:34:55,305 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:34:55,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:34:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:55,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 1704 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-13 15:34:55,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:35:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17934 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2024-11-13 15:35:03,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:35:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 17934 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2024-11-13 15:35:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710856435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:35:14,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:35:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 231 [2024-11-13 15:35:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368209885] [2024-11-13 15:35:14,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:35:14,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 231 states [2024-11-13 15:35:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:35:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 231 interpolants. [2024-11-13 15:35:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21558, Invalid=31572, Unknown=0, NotChecked=0, Total=53130 [2024-11-13 15:35:14,401 INFO L87 Difference]: Start difference. First operand 461 states and 462 transitions. Second operand has 231 states, 231 states have (on average 3.0216450216450217) internal successors, (698), 231 states have internal predecessors, (698), 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) [2024-11-13 15:35:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:35:30,570 INFO L93 Difference]: Finished difference Result 785 states and 814 transitions. [2024-11-13 15:35:30,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2024-11-13 15:35:30,571 INFO L78 Accepts]: Start accepts. Automaton has has 231 states, 231 states have (on average 3.0216450216450217) internal successors, (698), 231 states have internal predecessors, (698), 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 455 [2024-11-13 15:35:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:35:30,574 INFO L225 Difference]: With dead ends: 785 [2024-11-13 15:35:30,574 INFO L226 Difference]: Without dead ends: 785 [2024-11-13 15:35:30,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 711 SyntacticMatches, 70 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45141 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=25415, Invalid=41925, Unknown=0, NotChecked=0, Total=67340 [2024-11-13 15:35:30,579 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2116 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 892 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 892 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:35:30,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 101 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [892 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:35:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-13 15:35:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 701. [2024-11-13 15:35:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 699 states have (on average 1.0042918454935623) internal successors, (702), 700 states have internal predecessors, (702), 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) [2024-11-13 15:35:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 702 transitions. [2024-11-13 15:35:30,599 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 702 transitions. Word has length 455 [2024-11-13 15:35:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:35:30,600 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 702 transitions. [2024-11-13 15:35:30,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 231 states, 231 states have (on average 3.0216450216450217) internal successors, (698), 231 states have internal predecessors, (698), 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) [2024-11-13 15:35:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 702 transitions. [2024-11-13 15:35:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2024-11-13 15:35:30,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:35:30,608 INFO L215 NwaCegarLoop]: trace histogram [128, 128, 128, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:35:30,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 15:35:30,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 15:35:30,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:35:30,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:35:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash 645195313, now seen corresponding path program 2 times [2024-11-13 15:35:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:35:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013622723] [2024-11-13 15:35:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:35:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:35:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:35:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 39164 backedges. 0 proven. 14652 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2024-11-13 15:35:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:35:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013622723] [2024-11-13 15:35:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013622723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:35:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396754925] [2024-11-13 15:35:44,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:35:44,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:35:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:35:44,150 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:35:44,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:35:44,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:35:44,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:35:45,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 2584 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-13 15:35:45,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:35:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 39164 backedges. 0 proven. 14652 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2024-11-13 15:35:45,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:35:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 39164 backedges. 0 proven. 14652 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2024-11-13 15:35:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396754925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:35:53,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:35:53,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 130 [2024-11-13 15:35:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096327756] [2024-11-13 15:35:53,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:35:53,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2024-11-13 15:35:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:35:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2024-11-13 15:35:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2024-11-13 15:35:53,896 INFO L87 Difference]: Start difference. First operand 701 states and 702 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) [2024-11-13 15:35:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:35:59,258 INFO L93 Difference]: Finished difference Result 785 states and 786 transitions. [2024-11-13 15:35:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-13 15:35:59,260 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 695 [2024-11-13 15:35:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:35:59,265 INFO L225 Difference]: With dead ends: 785 [2024-11-13 15:35:59,265 INFO L226 Difference]: Without dead ends: 785 [2024-11-13 15:35:59,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1490 GetRequests, 1289 SyntacticMatches, 73 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2024-11-13 15:35:59,267 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1278 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:35:59,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 89 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 15:35:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-13 15:35:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2024-11-13 15:35:59,285 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) [2024-11-13 15:35:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 786 transitions. [2024-11-13 15:35:59,289 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 786 transitions. Word has length 695 [2024-11-13 15:35:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:35:59,290 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 786 transitions. [2024-11-13 15:35:59,290 INFO L472 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) [2024-11-13 15:35:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 786 transitions. [2024-11-13 15:35:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2024-11-13 15:35:59,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:35:59,298 INFO L215 NwaCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:35:59,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 15:35:59,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:35:59,502 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 15:35:59,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:35:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash 31244529, now seen corresponding path program 3 times [2024-11-13 15:35:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:35:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980333801] [2024-11-13 15:35:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:35:59,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:00,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:01,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:01,879 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:36:01,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (20 of 21 remaining) [2024-11-13 15:36:01,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-13 15:36:01,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-13 15:36:01,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-13 15:36:01,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-13 15:36:01,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-13 15:36:01,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-13 15:36:01,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-13 15:36:01,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-13 15:36:01,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2024-11-13 15:36:01,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2024-11-13 15:36:01,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2024-11-13 15:36:01,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2024-11-13 15:36:01,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2024-11-13 15:36:01,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2024-11-13 15:36:01,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2024-11-13 15:36:01,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-13 15:36:01,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-13 15:36:01,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-13 15:36:01,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2024-11-13 15:36:01,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-13 15:36:01,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:36:01,893 INFO L407 BasicCegarLoop]: Path program histogram: [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:02,269 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:36:02,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:36:02 BoogieIcfgContainer [2024-11-13 15:36:02,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:36:02,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:36:02,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:36:02,278 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:36:02,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:30:03" (3/4) ... [2024-11-13 15:36:02,282 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 15:36:02,582 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:36:02,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:36:02,584 INFO L158 Benchmark]: Toolchain (without parser) took 360464.54ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 91.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 230.1MB. Max. memory is 16.1GB. [2024-11-13 15:36:02,584 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:36:02,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.81ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 74.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:36:02,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.94ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:36:02,585 INFO L158 Benchmark]: Boogie Preprocessor took 75.84ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 71.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:36:02,585 INFO L158 Benchmark]: RCFGBuilder took 470.37ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 57.9MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:36:02,585 INFO L158 Benchmark]: TraceAbstraction took 359094.61ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 57.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 951.5MB. Max. memory is 16.1GB. [2024-11-13 15:36:02,585 INFO L158 Benchmark]: Witness Printer took 304.85ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 15:36:02,591 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.81ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 74.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.94ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.84ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 71.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 470.37ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 57.9MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 359094.61ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 57.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 951.5MB. Max. memory is 16.1GB. * Witness Printer took 304.85ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. 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}, n=128] [L538] *b++ = 0 VAL [a={-2:0}, b={-3:4}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, n=128] [L539] RET foo () [L540] b[-1] VAL [a={-2:0}, b={-3:4}, 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: 358.7s, OverallIterations: 20, TraceHistogramMax: 128, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7170 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7170 mSDsluCounter, 1364 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 893 mSDsCounter, 2518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4712 IncrementalHoareTripleChecker+Invalid, 7230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2518 mSolverCounterUnsat, 471 mSDtfsCounter, 4712 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4185 GetRequests, 2976 SyntacticMatches, 143 SemanticMatches, 1066 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74941 ImplicationChecksByTransitivity, 73.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=19, InterpolantAutomatonStates: 607, 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, 19 MinimizatonAttempts, 413 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 221.3s SatisfiabilityAnalysisTime, 86.3s InterpolantComputationTime, 5101 NumberOfCodeBlocks, 4729 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 5863 ConstructedInterpolants, 29 QuantifiedInterpolants, 26596 SizeOfPredicates, 20 NumberOfNonLiveVariables, 6158 ConjunctsInSsa, 396 ConjunctsInUnsatCore, 41 InterpolantComputations, 9 PerfectInterpolantSequences, 118187/233588 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! [2024-11-13 15:36:02,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c181add7-c106-4c0d-807d-0f32098dded4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)